Invariant consistency: A mechanism for inter-process ordering in distributed shared memory systems

Research output: Contribution to conferencePaper

5 Scopus citations

Abstract

The notion of invariant consistency was proposed that allowed the programmers to specify inter-process ordering requirements. Data consistency protocols provided a consistent view of the shared memory in the presence of multiple copies, implemented in message passing systems. The combination of invariant consistency and sequential consistency, known as InvSC consistency was studied, and a systematic way to modify the Lazy Cache algorithm for implementing InvSC consistency was proposed.

Original languageEnglish (US)
Pages447-448
Number of pages2
StatePublished - Jan 1 2002
Externally publishedYes
Event22nd International Conference on Distributed Systems - Vienna, Austria
Duration: Jul 2 2002Jul 5 2002

Other

Other22nd International Conference on Distributed Systems
CountryAustria
CityVienna
Period7/2/027/5/02

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Invariant consistency: A mechanism for inter-process ordering in distributed shared memory systems'. Together they form a unique fingerprint.

  • Cite this

    Singh, G. (2002). Invariant consistency: A mechanism for inter-process ordering in distributed shared memory systems. 447-448. Paper presented at 22nd International Conference on Distributed Systems, Vienna, Austria.