Where results make sense

About us   |   Why use us?   |   Reviews   |   PR   |   Contact us

Topic: Synchronization(computer science)

    Note: these results are not from the primary (high quality) database.

Ads by Google

In the News (Mon 7 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

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. www.ncsa.uiuc.edu /people/davem/Projects/ARPA/2q95/CS.html   (2866 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. Thread B, prints a message, notifies thread C, and blocks, Finally, thread D runs and prints its message, and notifies thread A. Only one thread is notified at a time. www.cs.mun.ca /~rod/winter02/cs4721/project2.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 time to acquire and release a lock on a critical section was 4.5 microseconds (440 cycles) within a single hypernode, while the time from when the lock is release until the blocked thread resumes execution is 6.7 microseconds (661 cycles). The time to acquire and release a lock on a critical section across hypernodes was 6.4 microseconds (630 cycles), while the time from when the lock is released until the blocked thread resumes execution is 10.4 microseconds (1016 cycles). archive.ncsa.uiuc.edu /General/Exemplar/ARPA/2q95/CS.html   (2866 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. www.cs.pdx.edu /~henselmn/course.php?cid=218   (145 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. en.wikipedia.org /wiki/Dining_philosophers_problem   (584 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. www.geocities.com /dipjyoti_iitg/projects.htm   (584 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 theory.lcs.mit.edu /~iandc/References/esik1999:131.html   (346 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. Although the method does not compute the probability distribution of all states in the chain, not even in implicit recursive form, it provides the necessary information to easily compute an extensive set of Markov reward functions such as the queue length or any of its higher moments. www.cs.wm.edu /~ciardo/pubs.html   (346 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. www.cs.unc.edu /Grants/Abstracts/CCR-9732916.html   (291 words)

Computer Science and Engineering Department, Washington University in St. Louis Computer Science and Engineering Department, Washington University in St. Louis Research Interests: Computer Architecture, Telecommunications Systems, Synchronization and Latency Hiding CSE students take 1st Place in Engineering at 11th Annual WU Graduate Student Research Symposium www.cse.seas.wustl.edu   (187 words)

UMass Amherst: Department of Computer Science We start with a novel reference counting algorithm that uses only fine-grained synchronization. With concurrent and garbage collected languages like Java and C# becoming popular, the need for a suitable non-intrusive, efficient, and concurrent multiprocessor garbage collector has become acute. All these garbage collectors were implemented on the Jikes research JVM and comparisons against Jikes collectors will be presented. www.cs.umass.edu /csinfo/colloquia/DEPT/petrank-2.html   (191 words)

Computer Science and Engineering Department, Washington University in St. Louis Computer Science and Engineering Department, Washington University in St. Louis Research Interests: Computer Architecture, Telecommunications Systems, Synchronization and Latency Hiding Research Interests: Embedded Middleware, Distributed Object Computing, Sensor Networks www.cse.seas.wustl.edu   (221 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. www.informatik.uni-trier.de /~ley/db/journals/tcs/tcs149.html   (221 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 www.cs.cmu.edu /~alumni/Theses.html   (221 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... In a camera, flash synchronization is required for the firing of a photographic flash to coincide with the shutter admitting light to the photographic film.... 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. The most used clock synchronization solution on the internet is the Internet Network Time Protocol (NTP) which is a layered client-server architecture based on UDP message passing. 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. 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. vip.cs.utsa.edu /nsf/pubs/starving/starving.html   (3344 words)

MTU Department of Computer Science Fisher Hall - Room 127 - Noon abstract Fisher Hall - Room 125 - 10:00 AM abstract Fisher Hall - Room 329 - 11:00 AM abstract www.cs.mtu.edu /html/Spring04events.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. www.webbasedprogramming.com /Java-Unleashed-Second-Edition   (5477 words)

UMass Amherst: Department of Computer Science Particular emphasis will be given to three major OS subsystems: process management (processes, threads, CPU scheduling, synchronization, and deadlock), memory management (segmentation, paging, swapping), file systems, and operating system support for distributed systems. Topics to be discussed include both explicitly and implicitly parallel programming languages, threads, message-passing, events, non-blocking synchronization, and transactions. Students will also create low patch proxy models of their characters to be used for blocking and simple motion within a final animation. www.cs.umass.edu /csinfo/autogen/cmpscidescs06.html   (6749 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. www-db.stanford.edu /pub/cstr/reports/cs/tr/99/1624/CS-TR-99-1624.bib   (215 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. 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. Wait freedom guarantees progress to all competing processes in a finite number of their own time steps, lock freedom guarantees progress to at least one process in finite time and obstruction freedom guarantees progress to processes only in the absence of contention. 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. research.sun.com /people/moir   (1055 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. www.di.unipi.it /ricerca/Report2002/node223.html   (1055 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). yara.ecn.purdue.edu /~pplinux/PPHOWTO/pphowto-3.html   (8330 words)

Serial communications - Wikipedia, the free encyclopedia Serial communications is used for all long-haul communications and most computer networks, where the cost of cable and synchronization difficulties make parallel communications impractical. In telecommunications and computer science, serial communications is the process of sending data one bit at one time, sequentially, over a communications channel or computer bus. Serial computer busses are becoming more common as improved technology enables them to transfer data at higher speeds. en.wikipedia.org /wiki/Serial_communications   (985 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. citeseer.ist.psu.edu /context/47475/0   (3142 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. www.freesoft.org /CIE/RFC/Orig/rfc942.txt   (3142 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. zeroknowledge.com /en/company/advisory.php   (1484 words)

Try your search on: Qwika (all wikis)

About us   |   Why use us?   |   Reviews   |   Press   |   Contact us   Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.