Selection-based Weak Sequential Consistency Models for Distributed Shared Memory

Based on time, processor, and data selection techniques, a group of Weak Sequential Consistency models have been proposed to improve the performance of Sequential Consistency for Distributed Shared Memory. These models can guarantee Sequential Consistency for data-race-free programs that are properly labelled. This paper reviews and discusses these models in terms of their use of the selection techniques. Their programmer interfaces are also discussed and compared. Among them the View-based Consistency model is recognized as the model that can offer the maximum performance advantage among the Weak Sequential Consistency models. An implementation of the View-based Consistency model has been given. Finally this paper suggests future directions of implementation effort for Distributed Shared Memory.

[1]  Willy Zwaenepoel,et al.  Techniques for reducing consistency-related communication in distributed shared-memory systems , 1995, TOCS.

[2]  Alan L. Cox,et al.  TreadMarks: shared memory computing on networks of workstations , 1996 .

[3]  Leslie Lamport,et al.  How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs , 2016, IEEE Transactions on Computers.

[4]  Mark D. Hill,et al.  A Unified Formalization of Four Shared-Memory Models , 1993, IEEE Trans. Parallel Distributed Syst..

[5]  Paul Hudak,et al.  Memory coherence in shared virtual memory systems , 1989, TOCS.

[6]  Michel Dubois,et al.  Memory access buffering in multiprocessors , 1998, ISCA '98.

[7]  Willy Zwaenepoel,et al.  Implementation and performance of Munin , 1991, SOSP '91.

[8]  Liviu Iftode,et al.  Scope Consistency: A Bridge between Release Consistency and Entry Consistency , 1996, SPAA '96.

[9]  Anoop Gupta,et al.  Memory consistency and event ordering in scalable shared-memory multiprocessors , 1990, [1990] Proceedings. The 17th Annual International Symposium on Computer Architecture.

[10]  Brian N. Bershad,et al.  The Midway distributed shared memory system , 1993, Digest of Papers. Compcon Spring.

[11]  Brian N. Bershad,et al.  Midway : shared memory parallel programming with entry consistency for distributed memory multiprocessors , 1991 .

[12]  Andrew S. Tanenbaum,et al.  Distributed operating systems , 2009, CSUR.

[13]  Alan L. Cox,et al.  An integrated compile-time/run-time software distributed shared memory system , 1996, ASPLOS VII.

[14]  Ricardo Bianchini,et al.  The affinity entry consistency protocol , 1997, Proceedings of the 1997 International Conference on Parallel Processing (Cat. No.97TB100162).

[15]  David Mosberger,et al.  Memory consistency models , 1993, OPSR.

[16]  Martin K. Purvis,et al.  View-based consistency and its implementation , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[17]  P. Keleher,et al.  Lazy release consistency for distributed shared memory , 1996 .

[18]  Abdul Sattar,et al.  Exploring Regional Locality in Distributed Shared Memory , 1998, ASIAN.

[19]  Abdul Sattar,et al.  Toward transparent selective sequential consistency in distributed shared memory systems , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).