Efficient synchronization of multiprocessors with shared memory
From MaRDI portal
Publication:3814768
DOI10.1145/48022.48024zbMATH Open0663.68011OpenAlexW2071226137MaRDI QIDQ3814768FDOQ3814768
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/
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
synchronizationinterconnection networkparallel processingparallel prefixarchitecture correctnessfetch-and-addmemory reference combiningread-modify-write
Cited In (26)
- Deterministic concurrency: a clock-synchronised shared memory approach
- Minimizing synchronization in \(\text{IDR}(s)\).
- Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors
- Linearizable counting networks
- Read-modify-write networks
- Real-time atomic multicast algorithms implemented on a shared memory multiprocessor
- Integrating synchronization with priority into a Kronecker representation
- Efficient randomized test-and-set implementations
- Hundreds of impossibility results for distributed computing
- An efficient synchronization model for OpenMP
- Bounded-wait combining: constructing robust and high-throughput shared objects
- $C\!\!-\!\!Lock$: Energy Efficient Synchronization for Embedded Multicore Systems
- A complexity theory of efficient parallel algorithms
- An almost tight RMR lower bound for abortable test-and-set
- Synchronous cooperation for explicit multi-threading
- The Power of Synchronization Mechanisms
- Solo-valency and the cost of coordination
- Bounds on the speedup and efficiency of partial synchronization in parallel processing systems
- A Scheme to Enforce Data Dependence on Large Multiprocessor Systems
- Resource control for synchronous cooperative threads
- The cost of concurrent, low-contention Read \& Modify \& Write
- Cooperative asynchronous update of shared memory
- A criterion for atomicity
- Combining funnels: A dynamic approach to software combining
- Title not available (Why is that?)
- The Synchronization Power of Coalesced Memory Accesses
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)
