The Computational Structure of Progress Conditions
Understanding the effect of different progress conditions on the computability of distributed systems is an important and exciting research direction. For a system with n processes, we define exponentially many new progress conditions and explore their properties and strength. We cover all the known, symmetric and asymmetric, progress conditions and many new interesting conditions. Together with our technical results, the new definitions provide a deeper understanding of synchronization and concurrency.
progress conditions synchronization wait-freedom obstruction-freedom s-freedom consensus contention cooperation universality hierarchy