This paper introduces a new communication abstraction, called Set-Constrained Delivery Broadcast (SCD-broadcast), whose aim is to provide its users with an appropriate abstraction level when they have to implement objects or distributed tasks in an asynchronous message-passing system prone to process crash failures. This abstraction allows each process to broadcast messages and deliver a sequence of sets of messages in such a way that, if a process delivers a set of messages including a message m and later delivers a set of messages including a message $m^{\prime }$, no process delivers first a set of messages including $m^{\prime }$ and later a set of message including m.

After having presented an algorithm implementing SCD-broadcast, the paper investigates its programming power and its computability limits. On the “power” side it presents SCD-broadcast-based algorithms, which are both simple and efficient, building objects (such as snapshot and conflict-free replicated data types), and distributed tasks. On the “computability limits” side it shows that SCD-broadcast and read/write registers are computationally equivalent.

本文介绍了一种新的通信抽象，称为Set-Constrained Delivery Broadcast (SCD-broadcast)，其目的是为用户提供适当的抽象级别，当他们必须在异步消息传递系统中实现对象或分布式任务时进程崩溃失败。这种抽象允许每个进程广播消息并以这样的方式传递一系列消息集，如果一个进程传递包含消息m 的一组消息，然后传递包含${米}^{\prime }$, 没有进程首先传递一组消息，包括 ${米}^{\prime }$然后是一组包含m的消息。

在介绍了实现 SCD 广播的算法之后，本文研究了它的编程能力和可计算性限制。在“电源”方面，它提出了基于 SCD 广播的算法，它们既简单又高效，构建对象（例如快照和无冲突复制数据类型）和分布式任务。在“可计算性限制”方面，它表明 SCD 广播和读/写寄存器在计算上是等效的。