Algorithms for scalable synchronization on shared-memory multiprocessors
- 1 February 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 9 (1) , 21-65
- https://doi.org/10.1145/103727.103729
Abstract
Busy-wait techniques are heavily used for mutual exclusion and barrier synchronization in shared-memory parallel programs. Unfortunately, typical implementations of busy-waiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become markedly more pronounced as applications scale. We argue in this paper that this problem is not fundamental, and that one can in fact construct busy-wait synchronization algorithms that induce no memory...Keywords
This publication has 33 references indexed in Scilit:
- Synchronization algorithms for shared-memory multiprocessorsComputer, 1990
- The performance of spin lock alternatives for shared-memory multiprocessorsIEEE Transactions on Parallel and Distributed Systems, 1990
- The performance implications of thread management alternatives for shared-memory multiprocessorsIEEE Transactions on Computers, 1989
- Two algorithms for barrier synchronizationInternational Journal of Parallel Programming, 1988
- The shared memory hypercubeParallel Computing, 1988
- The butterfly barrierInternational Journal of Parallel Programming, 1986
- The mutual exclusion problemJournal of the ACM, 1986
- The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel ComputerIEEE Transactions on Computers, 1983
- A new solution of Dijkstra's concurrent programming problemCommunications of the ACM, 1974
- Solution of a problem in concurrent programming controlCommunications of the ACM, 1965