article · 1993

A Sequentially Consistent Distributed Shared Memory

James Zhou Masaaki, James Z. Zhou, Masaaki Mizuno, Gurdip Singh

Cited by 0Abstract and details only

Abstract

Recently, distributed shared memory (DSM) systems have received much attention because such an abstraction simplifies programming. An important class of DSM implementations is one which uses cache memories to improve efficiency. In this paper, we present a cache-consistency protocol for DSM which requires significantly less communication than previously proposed protocols. This is achieved by maintaining one bit of state information for each cache object in the system. We prove that the protocol satisfies a formulation of sequential consistency. Index Terms : cache-consistency protocols, distributed shared memory, sequential consistency 1 Introduction In a distributed computing environment, distributed shared memory (DSM) systems have received much attention because such an abstraction simplifies programming. An important class of DSM implementations is one in which the This work was supported in part by the National Science Foundation under Grant CCR9201645. y This work wa...

Cite this paper

APA 7

Masaaki, J. Z., Zhou, J. Z., Mizuno, M., & Singh, G. (1993). A Sequentially Consistent Distributed Shared Memory.

MLA 9

Masaaki, James Zhou, et al. “A Sequentially Consistent Distributed Shared Memory.” 1993.

Chicago

Masaaki, James Zhou, James Z. Zhou, Masaaki Mizuno, and Gurdip Singh. 1993. “A Sequentially Consistent Distributed Shared Memory.”

Harvard

Masaaki, J.Z. et al. (1993) ‘A Sequentially Consistent Distributed Shared Memory’.

BibTeX

@article{masaaki1993sequentially,
  title = {{A Sequentially Consistent Distributed Shared Memory}},
  author = {Masaaki, James Zhou and Zhou, James Z. and Mizuno, Masaaki and Singh, Gurdip},
  year = {1993}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.