arXiv Open Access 2016

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

Niklas Ekström Seif Haridi

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DC

Penulis (2)

Niklas Ekström

Seif Haridi

Format Sitasi

APA MLA BibTeX

Ekström, N., Haridi, S. (2016). A Fault-Tolerant Sequentially Consistent DSM With a Compositional Correctness Proof. https://arxiv.org/abs/1608.02442

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2016
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓