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.

中文翻译：

---

基于复杂性的多处理器同步分类

多年来，Herlihy 优雅的基于可计算性的 Consensus Hierarchy 一直是我们对各种对象的相对能力的最好解释。由于真正的多处理器允许将它们支持的不同指令应用于任何内存位置，因此考虑组合不同对象支持的指令而不是考虑不同对象的集合是有意义的。令人惊讶的是，这会导致 Herlihy 基于可计算性的层次结构崩溃。在本文中，我们提出了一个替代方案：基于复杂性的多处理器同步指令集的相对能力分类，通过使用不同集合时解决无障碍共识所需的无限大小的内存位置的最小数量来捕获指示。