Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/a-complexity-based-classification-for-multiprocessor-synchronization-Sza9dv02eA
References (15)
-
G Taubenfeld (2006)
Synchronization Algorithms and Concurrent Programming -
P Jayanti, K Tan, S Toueg (2000)
Time and space lower bounds for nonblocking implementationsSIAM J. Comput., 30
-
J Aspnes, F Ellen (2014)
Tight bounds for adopt-commit objectsTheory Comput. Syst., 55
-
F Fich, M Herlihy, N Shavit (1998)
On the space complexity of randomized synchronizationJ. ACM, 45
-
H Attiya, JL Welch (2004)
Distributed Computing: Fundamentals, Simulations, and Advanced Topics -
M Herlihy (1991)
Wait-free synchronizationACM Trans. Program. Lang. Syst. (TOPLAS), 13
-
M Raynal (2012)
Concurrent Programming: Algorithms, Principles, and Foundations -
Y Afek, H Attiya, D Dolev, E Gafni, M Merritt, N Shavit (1993)
Atomic snapshots of shared memoryJ. ACM, 40
-
W-K Lo, V Hadzilacos (2000)
All of us are smarter than any of us: nondeterministic wait-free hierarchies are not robustSIAM J. Comput., 30
-
J Aspnes, M Herlihy (1990)
Fast randomized consensus using shared memoryJ. Algorithms, 11
-
R Guerraoui, E Ruppert (2007)
Anonymous and fault-tolerant shared-memory computingDistrib. Comput., 20
-
Z Bouzid, M Raynal, P Sutra (2018)
Anonymous obstruction-free $$(n, k)$$ ( n , k ) -set agreement with $$n-k+1$$ n - k + 1 atomic read/write registersDistrib. Comput., 31
-
R Gelashvili (2018)
On the optimal space complexity of consensus for anonymous processesDistrib. Comput., 31
-
M Herlihy, N Shavit (2012)
The Art of Multiprocessor Programming -
E Ruppert (2000)
Determining consensus numbersSIAM J. Comput., 30
- Publisher
- Springer Journals
- Copyright
- Copyright © Springer-Verlag GmbH Germany, part of Springer Nature 2019
- Subject
- Computer Science; Computer Communication Networks; Computer Hardware; Computer Systems Organization and Communication Networks; Software Engineering/Programming and Operating Systems; Theory of Computation
- ISSN
- 0178-2770
- eISSN
- 1432-0452
- DOI
- 10.1007/s00446-019-00361-3
- Publisher site
- See Article on Publisher Site
Abstract
For many years, Herlihy’s elegant computability-based Consensus Hierarchy has been our best explanation of the relative power of various objects. Since real multiprocessors allow the different instructions they support to be applied to any memory location, it makes sense to consider combining the instructions supported by different objects, rather than considering collections of different objects. Surprisingly, this causes Herlihy’s computability-based hierarchy to collapse. In this paper, we suggest an alternative: a complexity-based classification of the relative power of sets of multiprocessor synchronization instructions, captured by the minimum number of memory locations of unbounded size that are needed to solve obstruction-free consensus when using different sets of instructions.
Journal
Distributed Computing – Springer Journals
Published: Apr 4, 2020