连续任务和色单纯形逼近定理
Continuous Tasks and the Chromatic Simplicial Approximation Theorem
摘要:
著名的1999年Herlihy和Staut的异步可计算性定理(ACT)描述了无等待可解的分布式任务,从而揭示了与代数拓扑的深刻联系。我们提出了一个新的解释这个定理,通过连续任务的概念,定义的输入/输出规格是一个连续的功能。为了做到这一点,我们介绍了一个色版本的代数拓扑的基本结果:单纯逼近定理。除了为ACT提供不同的证明外,连续任务的概念本身似乎很有趣。事实上,除了某些分布式问题自然地由连续函数指定之外,连续任务还具有表达能力,例如,它还允许为可能的输入的每个组合指定期望输出的密度。
英文摘要:
The celebrated 1999 Asynchronous Computability Theorem (ACT) of Herlihy and Shavit characterized the distributed tasks that are wait-free solvable, and thus uncovered a deep connection with algebraic topology. We present a novel interpretation of this theorem, through the notion of continuous task, defined by an input/output specification that is a continuous function. To do so, we introduce a chromatic version of a foundational result for algebraic topology: the simplicial approximation theorem. In addition to providing a different proof of the ACT, the notion of continuous task seems interesting in itself. Indeed, besides the fact that certain distributed problems are naturally specified by continuous functions, continuous tasks have an expressive power that also allows to specify the density of desired outputs for each combination of possible inputs,for example.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。