Sequential Consistency in Distributed Systems : Theory and Implementation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1995

Sequential Consistency in Distributed Systems : Theory and Implementation


Recently, distributed shared memory (DSM) systems have received much attention because such an abstraction simplifies programming. It has been shown that many practical applications using DSMs require competing operations. We have aimed at unifying theory and implementations of protocols for sequential consistency, which provides competing operations. The results are useful not only to clarify previously proposed implementations but also to develop new efficient implementations for consistency criteria which provide competing operations, such as sequential consistency, weak ordering (with sequential consistency for competing accesses), and release consistency (with sequential consistency for competing accesses). By adopting concepts from concurrency control, we have developed theory for sequential consistency, called a \it sequentializability theory. This paper first presents the sequentializability theory, and then demonstrates the correctness of existing protocols using the theory. Finally, the paper presents new protocols which require significantly less communication than previously proposed protocols in systems which do not provide hardware atomic broadcasting facilities.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2437.pdf (308.88 Ko) Télécharger le fichier

Dates and versions

inria-00074237 , version 1 (24-05-2006)


  • HAL Id : inria-00074237 , version 1


Masaaki Mizuno, Michel Raynal, Junhui Z. Zhou. Sequential Consistency in Distributed Systems : Theory and Implementation. [Research Report] RR-2437, INRIA. 1995. ⟨inria-00074237⟩
234 View
457 Download


Gmail Facebook Twitter LinkedIn More