Efficient synchronization of multiprocessors with shared memory
- 1 October 1988
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 10 (4) , 579-601
- https://doi.org/10.1145/48022.48024
Abstract
A new formalism is given for read-modify-write (RMW) synchronization operations. This formalism is used to extend the memory reference combining mechanism introduced in the NYU Ultracomputer, to arbitrary RMW operations. A formal correctness proof of this combining mechanism is given. General requirements for the practicality of combining are discussed. Combining is shown to be practical for many useful memory access operations. This includes memory updates of the form mem _ val := mem _ val op val , where op need not be associative, and a variety of synchronization primitives. The computation involved is shown to be closely related to parallel prefix evaluation.Keywords
This publication has 13 references indexed in Scilit:
- Contention is no obstacle to shared-memory multiprocessingCommunications of the ACM, 1986
- On interprocess communicationDistributed Computing, 1986
- Essential Issues in Multiprocessor SystemsComputer, 1985
- Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential ProcessorsACM Transactions on Programming Languages and Systems, 1983
- Coordinating parallel processorsACM SIGARCH Computer Architecture News, 1981
- On describing the behavior and implementation of distributed systemsTheoretical Computer Science, 1981
- Parallel Prefix ComputationJournal of the ACM, 1980
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess ProgramsIEEE Transactions on Computers, 1979
- Communicating sequential processesCommunications of the ACM, 1978
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978