An algorithmic approach to the asynchronous computability theorem
Journal of Applied and Computational Topology(2018)
摘要
The asynchronous computability theorem (ACT) uses concepts from combinatorial topology to characterize which tasks have wait-free solutions in read–write memory. A task can be expressed as a relation between two chromatic simplicial complexes. The theorem states that a task has a protocol (algorithm) if and only if there is a certain color-preserving simplicial map compatible with that relation. The original proof of the ACT, given by Herlihy and Shavit (Proceedings of the 25th annual ACM symposium on theory of computing, pp 111–120, 1993 ; J ACM 46(6):858–923, 1999 ) relied on an involved geometric argument. Borowsky and Gafni (Proceedings of the 16th annual ACM symposium on principles of distributed computing, pp 189–198, 1997 ) later proposed an alternative proof based on a distributed algorithmic, termed the “convergence algorithm”. However the description of this algorithm was incomplete, and presented without proof. In this paper, we give the first complete description, along with a proof of correctness.
更多查看译文
关键词
Distributed computing,Asynchronous computability,Combinatorial algebraic topology,Link-connectivity,68-02,68Q10,68Q85
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络