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 language | English |
|---|---|
| Title of host publication | Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994 |
| Publisher | Association for Computing Machinery |
| Pages | 101-110 |
| Number of pages | 10 |
| Volume | Part F129432 |
| ISBN (Electronic) | 0897916549 |
| DOIs | |
| Publication status | Published - 14 Aug 1994 |
| Externally published | Yes |
| Event | 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994 - Los Angeles, United States Duration: 14 Aug 1994 → 17 Aug 1994 |
Conference
| Conference | 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994 |
|---|---|
| Country/Territory | United States |
| City | Los Angeles |
| Period | 14/08/94 → 17/08/94 |
Keywords
- Concurrency
- Distributed shared memory
- Memory consistency
- Synchronization
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Networks and Communications