A Fault-Tolerant Sequentially Consistent DSM With a Compositional Correctness Proof

TL;DR

This paper introduces the SC-ABD algorithm for fault-tolerant sequentially consistent distributed shared memory, improving communication efficiency and providing a compositional correctness proof.

Contribution

It presents a new algorithm that achieves sequential consistency with fewer communication rounds and a novel compositional correctness proof.

Findings

Requires less than half of processes to be faulty

Reduces communication rounds for write operations

Provides a compositional correctness proof

Abstract

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.