一个容错的序列一致DSM及其组合正确性证明
A Fault-Tolerant Sequentially Consistent DSM With a Compositional Correctness Proof
摘要：
我们提出了SC-ABD算法，实现顺序一致的分布式共享内存（DSM）。该算法容忍少于一半的进程是错误的（崩溃停止）。与多写入器ABD算法相比，SC-ABD需要一次而不是两次通信往返来执行写入操作，并且需要相等数量的往返（两次）来执行读取操作。虽然顺序一致性不是组合一致性条件，但提供的正确性证明是组合的。
英文摘要：
We present the SC-ABD algorithm that implements sequentially consistent distributed shared memory (DSM). The algorithm tolerates that less than half of the processes are faulty (crash-stop). Compared to the multi-writer ABD algorithm, SC-ABD requires one instead of two round-trips of communication to perform a write operation, and an equal number of round-trips (two) to perform a read operation. Although sequential consistency is not a compositional consistency condition, the provided correctness proof is compositional.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
