Asynchronous Computability Theorems for t-Resilient Systems.
DISC(2016)
摘要
A task is a distributed coordination problem where processes start with private inputs, communicate with one another, and then halt with private outputs. A protocol that solves a task is t-resilient if it tolerates halting failures by t or fewer processes. The t-resilient asynchronous computability theorem stated here characterizes the tasks that have t-resilient protocols in a shared-memory model. This result generalizes the prior (wait-free) asynchronous computability theorem of Herlihy and Shavit to a broader class of failure models, and requires introducing several novel concepts.
更多查看译文
关键词
Simplicial Complex, Protocol Complex, Private Input, Combinatorial Topology, Combinatorial Manifold
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络