A complexity-based classification for multiprocessor synchronization
Name
446_2019_361_ReferencePDF.pdf
Size
404.58 KB
Format
Adobe PDF
Checksum (MD5)
7015943a82a7e13c2cc6edb96af4f5e2
Author(s)
Ellen, Faith
Gelashvili, Rati
Shavit, Nir
Zhu, Leqi
Date Issued
September 4, 2019
Publisher
Springer Berlin Heidelberg
Version
Author's final manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00446-019-00361-3
