An Efficient implementation of sequentially consistent distributed shared memories

Abstract : Recently, distributed shared memory systems have received much attention because such an abstraction simplifies programming. In this paper, we present a data consistency protocol for a distributed system which implements sequentially consistent memories. The protocol is aimed at an environment where no special support for atomic broadcast exists. As compared to previously proposed protocols, our protocol eliminates the need of atomic broadcast and significantly reduces the amount of information flow among the processors. This is realized by maintaining state information and capturing causal relations among read and write operations.
Type de document :
[Research Report] RR-2085, INRIA. 1993
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 15:51:14
Dernière modification le : mercredi 16 mai 2018 - 11:23:02
Document(s) archivé(s) le : dimanche 4 avril 2010 - 22:20:17



  • HAL Id : inria-00074587, version 1


Masaaki Mizuno, Michel Raynal, Gurdip Singh, Mitchell Neilsen. An Efficient implementation of sequentially consistent distributed shared memories. [Research Report] RR-2085, INRIA. 1993. 〈inria-00074587〉



Consultations de la notice


Téléchargements de fichiers