通用组播(扩展版)
Generic Multicast (Extended Version)
AI总结:
本研究提出将原子广播、原子组播、通用广播整合为更通用的generic multicast(通用组播)原语,给出形式化定义与高效算法,在时空复杂度上表现更优,无冲突时消息最多经三次延迟即可投递。
摘要:
通信原语在现代计算中发挥着核心作用。它们为消息提供一系列可靠性与排序保证,使得复杂分布式交互的实现成为可能。其中,原子广播是实现容错分布式服务的关键抽象,该原语允许以全序方式在整个系统中分发消息。有两种组通信原语与原子广播密切相关:原子组播允许将消息发送给参与者的一个子集,该子集可能严格小于整个系统;通用广播则利用消息的语义,仅在必要时(即消息存在冲突时)对其进行排序。本文提出将所有这些原语整合为一种更通用的单一原语,称为generic multicast(通用组播)。我们形式化定义了通用组播提供的保证,并提出了高效算法。与已有工作相比,我们的方案在时间和空间复杂度方面具备优良特性。具体而言,当一次运行无冲突(即没有任何两条消息存在冲突)时,一条消息最多经过三次消息延迟即可被投递。
英文摘要:
Communication primitives play a central role in modern computing. They offer a panel of reliability and ordering guarantees for messages, enabling the implementation of complex distributed interactions. In particular, atomic broadcast is a pivotal abstraction for implementing fault-tolerant distributed services. This primitive allows disseminating messages across the system in a total order. There are two group communication primitives closely related to atomic broadcast. Atomic multicast permits targeting a subset of participants, possibly stricter than the whole system. Generic broadcast leverages the semantics of messages to order them only where necessary (that is when they conflict). In this paper, we propose to combine all these primitives into a single, more general one, called generic multicast. We formally specify the guarantees offered by generic multicast and present efficient algorithms. Compared to prior works, our solutions offer appealing properties in terms of time and space complexity. In particular, when a run is conflict-free, that is no two messages conflict, a message is delivered after at most three message delays.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。