A Complexity-Based Hierarchy for Multiprocessor Synchronization
© 2016 ACM. For many years, Herlihy's elegant computability based Con- sensus Hierarchy has been our best explanation of the rela- tive power of various types of multiprocessor synchronization objects when used in deterministic algorithms. However, key to this hierarchy is treating these instru...
Main Authors: | Ellen, Faith (Author), Gelashvili, Rati (Author), Shavit, Nir (Author), Zhu, Leqi (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
ACM,
2021-11-01T19:15:38Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
On the complexity of synchronization
by: Gelashvili, Rati
Published: (2017) -
Sparse sign-consistent Johnson-Lindenstrauss matrices: Compression with neuroscience-based constraints
by: Allen-Zhu, Zeyuan, et al.
Published: (2015) -
Leader election and renaming with optimal message complexity
by: Gelashvili, Rati
Published: (2014) -
On the Importance of Registers for Computability
by: Gelashvili, Rati, et al.
Published: (2016) -
Clock Synchronization for Moderm Multiprocessors
by: André dos Santos Oliveira
Published: (2019)