Mixed consistency: A model for parallel programming

Divyakant Agrawal, Manhoi Choy, Hong Va Leong, Ambuj K. Singh

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

18 Citations (Scopus)

Abstract

A general purpose parallel programming model called mixed consistency is developed for distributed shared memory systems. This model combines two kinds of weak memory consistency conditions: causal memory and pipelined random access memory, and provides four kinds of explicit synchronization operations: read locks, write locks, barriers, and await operations. The resulting suite of memory and synchronization operations can be tailored to solve most programming problems in an efficient manner. Conditions are also developed under which the net effect of programming in this model is the same as programming with sequentially consistent memory. Several examples are included to illustrate the model and the correctness conditions.
Original languageEnglish
Title of host publicationProceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994
PublisherAssociation for Computing Machinery
Pages101-110
Number of pages10
VolumePart F129432
ISBN (Electronic)0897916549
DOIs
Publication statusPublished - 14 Aug 1994
Externally publishedYes
Event13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994 - Los Angeles, United States
Duration: 14 Aug 199417 Aug 1994

Conference

Conference13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994
CountryUnited States
CityLos Angeles
Period14/08/9417/08/94

Keywords

  • Concurrency
  • Distributed shared memory
  • Memory consistency
  • Synchronization

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this