We study the effect of different progress conditions on the computability of distributed systems. For a system with n processes, we define exponentially many new progress conditions and explore their properties and relative strength. We cover many known and new interesting conditions and propose a new classification for evaluating the strength of shared objects. The classification is based on finding, for each object of type o , the strongest progress condition for which it is possible to solve consensus for any number of processes, using any number of objects of type o and atomic registers. Comparing our classification with the traditional one, which is based on fixing the progress condition (namely, wait-freedom) and finding the largest number of processes for which consensus is solvable, reveals interesting results. Together with our technical results, the new definitions provide a deeper understanding of synchronization and concurrency.

中文翻译：

---

进度条件和共享对象的计算结构

我们研究了不同的进度条件对分布式系统的可计算性的影响。对于具有 n 个进程的系统，我们以指数方式定义许多新的进程条件并探索它们的属性和相对强度。我们涵盖了许多已知和新的有趣条件，并提出了一种用于评估共享对象强度的新分类。分类基于发现，对于每个 o 类型的对象，可以使用任意数量的 o 类型对象和原子寄存器解决任意数量进程的共识的最强进展条件。将我们的分类与传统分类进行比较，传统分类基于固定进度条件（即等待自由）并找到可解决共识的最大进程数，揭示了有趣的结果。