A Complexity-Based Hierarchy for Multiprocessor Synchronization
Preprint
Abstract
For many years, Herlihy's elegant computability based Consensus Hierarchy has been our best explanation of the relative power of various types of multiprocessor synchronization objects when used in deterministic algorithms. However, key to this hierarchy is treating synchronization instructions as distinct objects, an approach that is far from the real-world, where multiprocessor programs apply synchronization instructions to collections of arbitrary memory locations. We were surprised to realize that, when considering instructions applied to memory locations, the computability based hierarchy collapses. This leaves open the question of how to better capture the power of various synchronization instructions. In this paper, we provide an approach to answering this question. We present a hierarchy of synchronization instructions, classified by their space complexity in solving obstruction-free consensus. Our hierarchy provides a classification of combinations of known instructions that seems to fit with our intuition of how useful some are in practice, while questioning the effectiveness of others. We prove an essentially tight characterization of the power of buffered read and write instructions.Interestingly, we show a similar result for multi-location atomic assignments.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- A Simple Object that Spans the Whole Consensus HierarchyParallel Processing Letters, 2018
- Tight Bounds for Adopt-Commit ObjectsTheory of Computing Systems, 2013
- Concurrent Programming: Algorithms, Principles, and Foundations2013
- Determining Consensus NumbersSIAM Journal on Computing, 2000
- All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not RobustSIAM Journal on Computing, 2000
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- Fast randomized consensus using shared memoryJournal of Algorithms, 1990