Efficient synchronization of multiprocessors with shared memory

DOI10.1145/48022.48024MaRDI QIDQ3814768zbMATH OpenOpenAlexFDO

Authors Marc Snir, Clyde Kruskal, Larry Rudolph

Publication date 1988

Published in ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL http://www.acm.org/pubs/contents/journals/toplas/1988-10/

zbMATH Keywords

architecture correctnessfetch-and-addinterconnection networkmemory reference combiningparallel prefixparallel processingread-modify-writesynchronization

Mathematics Subject Classification ID

Theory of operating systems (68N25) Theory of software (68N99)

Recommendations

• Performance issues in non-blocking synchronization on shared-memory multiprocessors
• An experience using different synchronisation mechanisms on a shared memory multiprocessors
• scientific article; zbMATH DE number 1875365
• scientific article; zbMATH DE number 3997156
• On the power of synchronization in parallel computations
• scientific article; zbMATH DE number 17800

Cited in

(26)

• A criterion for atomicity
• Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors
• Real-time atomic multicast algorithms implemented on a shared memory multiprocessor
• Combining funnels: A dynamic approach to software combining
• The cost of concurrent, low-contention Read \& Modify \& Write
• Efficient randomized test-and-set implementations
• Deterministic concurrency: a clock-synchronised shared memory approach
• Solo-valency and the cost of coordination
• Bounded-wait combining: constructing robust and high-throughput shared objects
• Synchronous cooperation for explicit multi-threading
• Resource control for synchronous cooperative threads
• Minimizing synchronization in \(\text{IDR}(s)\).
• The Synchronization Power of Coalesced Memory Accesses
• Cooperative asynchronous update of shared memory
• The Power of Synchronization Mechanisms
• Bounds on the speedup and efficiency of partial synchronization in parallel processing systems
• Integrating synchronization with priority into a Kronecker representation
• A Scheme to Enforce Data Dependence on Large Multiprocessor Systems
• An almost tight RMR lower bound for abortable test-and-set
• Linearizable counting networks
• Hundreds of impossibility results for distributed computing
• Read-modify-write networks
• scientific article; zbMATH DE number 3892581 (Why is no real title available?)
• C\!\!-\!\!Lock: Energy Efficient Synchronization for Embedded Multicore Systems
• An efficient synchronization model for OpenMP
• A complexity theory of efficient parallel algorithms

This page was built for publication: Efficient synchronization of multiprocessors with shared memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3814768)