序列一致性的构造与实现
On Composition and Implementation of Sequential Consistency
摘要：
为了在同步消息传递系统中实现可线性化的共享存储器，有必要等待一段时间，该时间与读写操作的网络延迟的不确定性成线性关系。只等待其中一个就足以实现顺序一致性。本文将这一结果扩展到易崩溃的异步系统，提出了一种分布式算法，在异步消息传递系统的顶部上构建顺序一致的共享快照内存，其中不到一半的进程可能会崩溃。我们证明，等待是需要的，只有当一个进程调用一个读/快照后写。我们还表明，顺序一致性是可组合的，在某些情况下，通常会遇到：1）对象，如果他们被实现在一个可线性化的内存顶部线性化成为顺序一致时，实现在一个顺序的内存顶部，同时保持可组合和2）在基于轮的算法，其中每个对象只在一轮访问。
英文摘要：
To implement a linearizable shared memory in synchronous message-passing systems it is necessary to wait for a time linear to the uncertainty in the latency of the network for both read and write operations. Waiting only for one of them suffices for sequential consistency. This paper extends this result to crash-prone asynchronous systems, proposing a distributed algorithm building a sequentially consistent shared snapshot memory on top of an asynchronous message-passing system where less than half of the processes may crash. We prove that waiting is needed only when a process invokes a read/snapshot right after a write. We also show that sequential consistency is composable in some cases commonly encountered: 1) objects that would be linearizable if they were implemented on top of a linearizable memory become sequentially consistent when implemented on top of a sequential memory while remaining composable and 2) in round-based algorithms, where each object is only accessed within one round.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
