Synchronization algorithms for shared-memory multiprocessors
Gary Graunke, S. Thakkar · Computer · 1990
A performance evaluation of the Symmetry multiprocessor system revealed that the synchronization mechanism did not perform well for highly contested locks, like those found in certain parallel applications. Several software synchronization mechanisms were developed and evaluated, using a hardware monitor, on the Symmetry multiprocessor system; the mechanisms were to reduce contention for the lock. The mechanisms remain valuable even when changes are made to the hardware synchronization mechanism to improve support for highly contested locks. The Symmetry architecture is described, and a number of lock algorithms and their use of hardware resources are examined. The performance of each lock is observed from the perspective of both the program itself and the total system performance. >
Cited by 213 works. doi:10.1109/2.55501
Authors
References
- The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer
- Dynamic decentralized cache schemes for mimd parallel processors
- A fast mutual exclusion algorithm
- The performance of spin lock alternatives for shared-memory multiprocessors
- Efficient synchronization primitives for large-scale cache-coherent multiprocessors
- Efficient synchronization primitives for large-scale cache-coherent multiprocessors
- The Symmetry Multiprocessor System.
- A survey of synchronization methods for parallel computers