通过几何化对子迭代即时快照消息对手进行拓扑构造及其在集合一致性问题中的应用
A Topology by Geometrization for Sub-Iterated Immediate Snapshot Message Adversaries and Applications to Set-Agreement
AI总结:
本文针对一般子IIS消息对手,提出基于几何单纯复形的新拓扑方法,直接在执行集合上定义拓扑,并据此给出集合一致性问题的完整刻画与下界。
摘要:
迭代即时快照模型(IIS)是消息对手设定中的核心模型。我们考虑一般消息对手,其执行是IIS消息对手执行的任意子集。我们基于几何单纯复形,为这类一般对手提出一种新的拓扑方法。我们能够直接在所考虑的执行集合上定义拓扑,这为分布式可计算性提供了更简单且更强大的拓扑使用方式。作为这一新框架的应用,我们给出了求解一般子IIS消息对手的集合一致性问题的完整刻画和下界。
英文摘要:
The Iterated Immediate Snapshot model (IIS) is a central model in the message adversary setting. We consider general message adversaries whose executions are arbitrary subsets of the executions of the IIS message adversary. We present a new topological approach for such general adversaries, based upon geometric simplicial complexes. We are able to define a topology directly on the considered sets of executions, which gives both simpler and more powerful ways of using topology for distributed computability. As application of this new framework, we present a complete characterization and lower bounds for solving set-agreement for general sub-IIS message adversaries.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。