|
| |
| | Computer Science |
 | | The key thread performance characteristics measured were the latency of thread creation and deletion, barrier synchronization cost, lock acquisition and release, and the cost of atomic fetch and increment operations. | | | The key multi-hypernode thread performance characteristics measure were the latency of thread creation and deletion, barrier synchronization cost, lock acquisition and release, and the cost of atomic fetch and increment operations. | | | The goal of the Illinois Concert Project is to develop technology enabling the efficient execution of irregular computations through a concurrent object-oriented paradigm. |
|
http://www.ncsa.uiuc.edu/people/davem/Projects/ARPA/2q95/CS.html
(2866 words)
|
|
| |
| | Dining philosophers problem - Wikipedia, the free encyclopedia |
| | In computer science, the dining philosophers problem is an illustrative example of a common computing problem in concurrency. | | | The lack of available forks is an analogy to the locking of scarce resources in real computer programming, a situation known as concurrency. | | | In 1965, Edsger Dijkstra used the example of a group of philosophers to solve a synchronization problem. |
|
http://en.wikipedia.org/wiki/Dining_philosophers_problem
(584 words)
|
|
| |
| | Computer Science 4721: Project 2 |
| | The master thread should print out the total sum and terminate the program when all work items are returned. | | | In this part of the project, you should implement three synchronization methods that implement the blocking and notification. | | | The worker should then open the file and read its contents to produce the sum of integers in the file. |
|
http://www.cs.mun.ca/~rod/winter02/cs4721/project2.html
(614 words)
|
|
| |
| | Gianfranco Ciardo's Publications |
| | We correct some problems in the approach presented by Lu, Zhang, and Murata in their paper ``Analysis of self-stabilizing clock synchronization by means of stochastic Petri nets'', then we study the same system using the computer package DSPNexpress, and present the computational effort as a function of the number of clocks in the system. | | | Computer Aided Verification (CAV 2003), Boulder, CO, USA, LNCS 2725, pages 40-53, July 2003. | | | Sophisticated steady-state and transient solvers are available; cumulative and up-to-absorption measures can be computed. |
|
http://www.cs.wm.edu/~ciardo/pubs.html
(614 words)
|
|
| |
| | Computer Science |
| | The key thread performance characteristics measured were the latency of thread creation and deletion, barrier synchronization cost, lock acquisition and release, and the cost of atomic fetch and increment operations. | | | The goal of the Illinois Concert Project is to develop technology enabling the efficient execution of irregular computations through a concurrent object-oriented paradigm. | | | Finally, the cost of the same cached and uncached fetch and increment operations are shown in table 11. |
|
http://archive.ncsa.uiuc.edu/General/Exemplar/ARPA/2q95/CS.html
(2866 words)
|
|
| |
| | CCR-9732916 Abstract (UNC-CH Computer Science) |
| | Most lock-based synchronization algorithms perform poorly in the face of such delays, because a delayed process holding a lock, can impede the progress of other processes waiting for that lock. | | | Lock-free and wait-free algorithms are implemented without locking mechanisms. | | | Furthermore, lock-based algorithms are susceptible to problems such as deadlock and priority inversion. |
|
http://www.cs.unc.edu/Grants/Abstracts/CCR-9732916.html
(291 words)
|
|
| |
| | Computer Science Course Listing |
| | Explain the trade-offs involved between a top-half kernel thread and a bottom-half interrupt-driven "thread". | | | Use modular programming techniques to write installable modules that include kernel timers, kernel threads, and kernel-based i/o. | | | Apply the core concepts of mutual exclusion, serialization, and synchronization to operating system programming problems. |
|
http://www.cs.pdx.edu/~henselmn/course.php?cid=218
(145 words)
|
|
| |
| | Information and Computation Bibliography |
| | Iteration theories provide a sound and complete axiomatization of the equational properties of the iteration (or fixed point) operation in many models of theoretical computer science including ordered and metric structures, trees and synchronization trees. | | | In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science | | | In 17th Annual Symposium on Foundations of Computer Science |
|
http://theory.lcs.mit.edu/~iandc/References/esik1999:131.html
(346 words)
|
|
| |
| | SCS Doctoral Theses |
| | Keywords: Computer science, artificial intelligence, interactive drama, interactive story, interactive fiction, interactive art, interactive entertainment, abstract adversary search, memoized search, sampled search, sampling search, SAS, SAS+, MFC, MMFC, aesthetic evaluation function, user experience, Oz Project | | | Keywords: Theoretical computer science, artificial intelligence, computational learning theory, machine learning, algorithms fourier analysis, perceptrons, classification learning, rule extraction, boolean circuits, disjunction normal form (DNF), threshold of parities (TOP), hypothesis boosting, harmonic sieve | | | Keywords: Parallel computing, reconfigurable networks, barrier synchronization, communication context switch, virtual circuits, bandwidth reservation, communication scheduling |
|
http://www.cs.cmu.edu/~alumni/Theses.html
(346 words)
|
|
| |
| | dj's Homepage |
| | Barua, Professor, Computer Science and Engineering, IIT Guwahati | | | Chattopadhyay, HOD, Computer Science and Engineering, IIT Guwahati | | | The System was implemented using the Oracle Database Management System and issues such as Synchronization and Concurrent Access Control were addressed. |
|
http://www.geocities.com/dipjyoti_iitg/projects.htm
(346 words)
|
|
| |
| | UMass Amherst: Department of Computer Science |
| | We start with a novel reference counting algorithm that uses only fine-grained synchronization. | | | We propose novel garbage collection algorithms based on a framework called "sliding views". | | | All these garbage collectors were implemented on the Jikes research JVM and comparisons against Jikes collectors will be presented. |
|
http://www.cs.umass.edu/csinfo/colloquia/DEPT/petrank-2.html
(191 words)
|
|
| |
| | Theoretical Computer Science, Volume 149 |
| | Context-Specific Synchronization for Atomic Data Types in Object-Based Databases. | | | On Interprocess Communication and the Implementation of Multi-Writer Atomic Registers. |
|
http://www.informatik.uni-trier.de/~ley/db/journals/tcs/tcs149.html
(191 words)
|
|
| |
| | Synchronization: Facts and details from Encyclopedia Topic |
| | Framerightclock driftclock synchronization is a problem from computer science which deals with the idea that internal clocks of several computers may differ.... | | | Non-blocking synchronization is a technique that uses special algorithms to avoid threads competing for a shared resource (computer science)resource having... | | | Synchronization is important in fields such as digital telephony[For more facts and a topic of this subject, click this link], EHandler: no quick summary. |
|
http://www.absoluteastronomy.com/encyclopedia/s/sy/synchronization.htm
(1796 words)
|
|
| |
| | Clock synchronization - Wikipedia, the free encyclopedia |
| | Clock synchronization is a problem from computer science which deals with the idea that internal clocks of several computers may differ. | | | Cristian's algorithm and the Berkeley Algorithm are some solutions to the clock synchronization problem in a centralized server environment. | | | Besides the incorrectness of the time itself, there are problems associated with clock skew that take on more complexity in a distributed system in which several computers will need to realize the same global time. |
|
http://en.wikipedia.org/wiki/Clock_synchronization
(1796 words)
|
|
| |
| | starving.html |
| | It can be used to teach about monitors and monitor implementation options, it can be used to teach about the dining philosophers problem and it can be used as a testbed for teaching experimental techniques in computer science. | | | Monitors were chosen for the simulation, because of the emergence of the Java language, which uses monitor concepts for its synchronization. | | | A monitor is a synchronization construct that enforces mutual exclusion. |
|
http://vip.cs.utsa.edu/nsf/pubs/starving/starving.html
(3344 words)
|
|
| |
| | Java Unleashed Second Edition |
| | A graduate of Rutgers University with a degree in computer science, he enjoys rollerblading, cycling, and playing digital music in his spare time. | | | Chapter 9, "Threads and Multithreading," covers the basics of programming with threads including the use of monitors. | | | Chapter 21, "Creating User Interface Components," explains some advanced tricks accomplished using the AWT such as password-protected text fields and scrolling-image panels. |
|
http://www.webbasedprogramming.com/Java-Unleashed-Second-Edition
(5477 words)
|
|
| |
| | CS-TR-99-1624.bib |
| | BIB-VERSION:: CS-TR-v2.0 ID:: STAN//CS-TR-99-1624 ENTRY:: August 26, 1999 ORGANIZATION:: Stanford University, Department of Computer Science TITLE:: Non-blocking Synchronization and System Design TYPE:: Thesis TYPE:: Technical Report AUTHOR:: Greenwald, Michael DATE:: August 1999 PAGES:: 261 ABSTRACT:: Non-blocking synchronization (NBS) has significant advantages over blocking synchronization in areas of fault-tolerance, system structure, portability, and performance. | | | This thesis demonstrates that non-blocking synchronization is practical as the sole co-ordination mechanism in systems by showing that careful OS design eases implementation of efficient NBS, by demonstrating that DCAS (Double-Compare-and-Swap) is the necessary and sufficient primitive for implementing NBS, and by demonstrating that efficient hardware DCAS is practical for RISC processors. | | | I demonstrate that proposed OS implementations of DCAS are inefficient, and propose a design for efficient hardware DCAS specific to the R4000 but generalizable to other RISC processors. |
|
http://www-db.stanford.edu/pub/cstr/reports/cs/tr/99/1624/CS-TR-99-1624.bib
(215 words)
|
|
| |
| | Citations: An Overview of Clock Synchronization - Simons, Lundelius-Welch, Lynch (ResearchIndex) |
| | Simons B., Lundelius-Welch J. and Lynch N., "An Overview of Clock Synchronization", in Simons B. and Spector A., (eds.): Fault-Tolerant Distributed Computing, Springer Lecture Notes on Computer Science 448, pp. | | | In Fault-Tolerant Distributed Computing (Simons and Spector, eds), Springer Verlag Lecture Notes in Computer Science 448, 1990, 8496. | | | Simons, J. Welch, and N. Lynch, An Overview of Clock Synchronization, in B. Simons and A. Spector eds., Fault-Tolerant Distributed Computing, LNCS 448, Springer-Verlag, 84-96, 1990. |
|
http://citeseer.ist.psu.edu/context/47475/0
(3142 words)
|
|
| |
| | Nat' Academies Press, The Future of Supercomputing: An Interim Report (2003) |
| | While a professor of electrical engineering and computer science at the Massachusetts Institute of Technology, his group built the J-Machine and the M-Machine, experimental parallel computer systems that pioneered the separation of mechanisms from programming models and demonstrated very low overhead synchronization and communication mechanisms. | | | Dally and his group have developed system architecture, network architecture, signaling, routing, and synchronization technology that can be found in most large parallel computers today. | | | He is currently a professor of electrical engineering and computer science at Stanford University, where his group developed the Imagine processor, which introduced the concepts of stream processing and partitioned register organizations. |
|
http://www.nap.edu/books/0309089956/html/33.html
(5020 words)
|
|
| |
| | resume.doc |
| | Education 2003-present Candidate for Ph.D. in Computer Science, University of Rochester M.S. in Computer Science, University of Iowa M.C.S. in Computer Science, University of Pune B.C.S. in Computer Science, University of Pune Research Experience University of Rochester, 2003-present Software Transactional Memory (STM) STM is a generic nonblocking synchroniza-tion construct. | | | So far I have pursued my interests in synchronization algorithms for highly parallel systems, ad hoc routing (especially in ad hoc sensor networks), overlay networks, P2P routing (via distributed hash tables), micro-kernel designs, and memory systems. | | | This projects goal is not only to come up with a formal generalization of these nonblocking classes of algorithms, but also to bridge the gap between lock freedom and wait freedom, with a stronger progress guarantee than that of lock freedom but weaker guarantee than that of wait freedom. |
|
http://www.cs.rochester.edu/~vmarathe/resume/resume.doc
(1055 words)
|
|
| |
| | Mark Moir |
| | Mark Moir received the B.Sc.(Hons.) degree in Computer Science from Victoria University of Wellington, New Zealand in 1988, and the Ph.D. degree in Computer Science from the University of North Carolina at Chapel Hill, USA in 1996. | | | Moir's main research interests concern practical and theoretical aspects of concurrent, distributed, and real-time systems, particularly hardware and software support for programming constructs that facilitate scalable synchronization in shared memory multiprocessors. | | | In June 2000, he joined Sun Microsystem Laboratories, where he is now the Principal Investigator of the Scalable Synchronization Research Group. |
|
http://research.sun.com/people/moir
(1055 words)
|
|
| |
| | Citations: Amalgamation of graph transformations: a synchronization mechanism - Bohm, Fonio, Habel (ResearchIndex) |
| | Bohm, H.-R. Fonio, and A. Habel, "Amalgamation of graph transformations: a synchronization mechanism," Journal of Computer and System Science, vol. | | | Bohm, H.-R. Fonio, and A. Habel, Amalgamation of graph transformations: a synchronization mechanism, J. of Comp. | | | The algebraic approach [2,3,4,5] has been worked out for several years and provides interesting results for parallelism analysis [6,7] efficient evaluation of functional expressions [8,9] and logic programs [10] synchronization mechanisms |
|
http://sherry.ifi.unizh.ch/context/183410/0
(1361 words)
|
|
| |
| | Publications |
| | Ferrari G., Montanari U. and Tuosto E., ``A LTS Semantics of Ambients via Graph Synchronization with Mobility'', in A. Restivo, S. Ronchi Della Rocca and L. Roversi, editors, Proceedings of ICTCS'01, 7th Italian Conference on Theoretical Computer Science, volume 2202 of Lect. | | | Corradini A. and Gadducci F., ``A Functorial Semantics for Multi-Algebras and Partial Algebras, with Applications to Syntax'', Theoretical Computer Science 286(2): 293-322, 2002. | | | Corradini F., Ferrari G. and Pistore M., ``On the Semantics of Durational Actions'', Theoretical Computer Science 269(1-2):47-82, 2001. |
|
http://www.di.unipi.it/ricerca/Report2002/node223.html
(1361 words)
|
|
| |
| | Linux Parallel Processing HOWTO: Clusters Of Linux Systems |
| | The PAPERS (Purdue's Adapter for Parallel Execution and Rapid Synchronization) project, http://garage.ecn.purdue.edu/~papers/, at the Purdue University School of Electrical and Computer Engineering is building scalable, low-latency, aggregate function communication hardware and software that allows a parallel supercomputer to be built using unmodified PCs/workstations as nodes. | | | The SHRIMP project, http://www.CS.Princeton.EDU/shrimp/, at the Princeton University Computer Science Department is building a parallel computer using PCs running Linux as the processing elements. | | | SCSI (Small Computer Systems Interconnect) is essentially an I/O bus that is used for disk drives, CD ROMS, image scanners, etc. There are three separate standards SCSI-1, SCSI-2, and SCSI-3; Fast and Ultra speeds; and data path widths of 8, 16, or 32 bits (with FireWire compatibility also mentioned in SCSI-3). |
|
http://yara.ecn.purdue.edu/~pplinux/PPHOWTO/pphowto-3.html
(8330 words)
|
|
| |
| | rfc942.txt |
| | The National Research Council was established by the National Academy of Sciences in 1916 to associate the broad community of science and technology with the Academy's purposes of furthering knowledge and of advising the federal government. | | | Indeed, the nation is becoming dependent upon their efficiency and reliability, and the recent proliferation of networks and their widespread use have emphasized the importance of developing uniform conventions, or protocols, for communication between computer systems. | | | The lack of full synchronization of the signal and normal data in TP-4 may require users to insert their own synchronization marks in the normal data stream [as was the case with the old ARPA Network Control Program (NCP)], and the limitation of one outstanding signal may be restrictive. |
|
http://www.freesoft.org/CIE/RFC/Orig/rfc942.txt
(985 words)
|
|
| |
| | ZKS :: Advisory Board |
| | Simons received her Ph.D. in computer science from the University of California at Berkeley and then joined the Research Division of IBM, where she received an IBM Research Division Award for her work on clock synchronization. | | | A recipient of the CPSR Norbert Wiener Award for Professional and Social Responsibility in computing, she was selected as one of Open Computing's top 100 women in computing and named Alumnus of the Year by the Computer Science Department at U.C. Berkeley in 2000. | | | Simons was elected Secretary of the Council of Scientific Society Presidents (CSSP) in 1999, and has been a member of the U.C. Berkeley Engineering Fund Board of Directors since 1998, the same year she received the EFF Pioneer Award. |
|
http://zeroknowledge.com/en/company/advisory.php
(1484 words)
|
|
| |
| | Publication list of Arthur ter Hofstede |
| | UML Activity Diagrams as a Workflow Specification Language, Proceedings of the 4th International Conference on the Unified Modeling Language (UML): Modeling Languages, Concepts, and Tools, volume 2185 of Lecture Notes in Computer Science, pages 76-90, Toronto, Canada, October 2001. | | | In R. Andersen, J.A. Bubenko, and A. Solvberg, editors, Proceedings of the Third International Conference CAiSE'91 on Advanced Information Systems Engineering, volume 498 of Lecture Notes in Computer Science, pages 502-524, Trondheim, Norway, May 1991. | | | Y.W. Si, D. Edmond, A. ter Hofstede, and M. Dumas, A Model for the Configurable Composition and Synchronization of Complex Trading Activities, Proceedings of the 18th ACM Symposium on Applied Computing (SAC), Melbourne FL, USA, March 2003, ACM Press. |
|
http://sky.fit.qut.edu.au/~terhofst/ppublist.html
(1484 words)
|
|
| |
| | Nat' Academies Press, Getting Up to Speed: The Future of Supercomputing (2004) |
| | While a professor of electrical engineering and computer science at the Massachusetts Institute of Technology (MIT), his group built the J-Machine and the M-Machine, experimental parallel computer systems that pioneered the separation of mechanisms from programming models and demonstrated very low overhead synchronization and communication mechanisms. | | | Wallach was an engineer at Raytheon from 1971 to 1975, where he participated in various hardware design efforts, including the computer used to control the launching of the Patriot missile system and various signal processors. | | | At Caltech, he designed the MOSSIM Simulation Engine and the Torus Routing Chip, which pioneered wormhole routing and virtual-channel flow control. |
|
http://www.nap.edu/books/0309095026/html/247.html
(5432 words)
|
|
|
