Thin locks
David F. Bacon, Ravi B. Konuru, Chet Murthy et al. · ACM SIGPLAN Notices · 1998
Language-supported synchronization is a source of serious performance problems in many Java programs. Even single-threaded applications may spend up to half their time performing useless synchronization due to the thread-safe nature of the Java libraries. We solve this performance problem with a new algorithm that allows lock and unlock operations to be performed with only a few machine instructions in the most common cases. Our locks only require a partial word per object, and were implemented without increasing object size. We present measurements from our implementation in the JDK 1.1.2 for AIX, demonstrating speedups of up to a factor of 5 in micro-benchmarks and up to a factor of 1.7 in real programs.
Cited by 27 works. doi:10.1145/277652.277734 Open-access PDF
Authors
References
- Monitors
- Experience with processes and monitors in Mesa
- Solution of a problem in concurrent programming control
- Algorithms for scalable synchronization on shared-memory multiprocessors
- Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors
- A fast mutual exclusion algorithm
- The performance of spin lock alternatives for shared-memory multiprocessors
- The mutual exclusion problem
- A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables
- Efficient synchronization of multiprocessors with shared memory