Exploring Regional Locality in Distributed Shared Memory

Two most commonly used classifications of reference locality are: temporal locality and spatial locality. This paper introduces a new class of reference locality, called Regional Locality, which is the program behavior that a set of addresses which are accessed in one critical or non-critical region will be very likely accessed as a whole in the same critical region or other non-critical regions. We proposed three updates propagation protocols based on Regional Locality in Distributed Shared Memory systems. These protocols include: Selective Lazy/Eager Updates Propagation protocol, First Hit Updates Propagation protocol, and Second Hit Updates Propagation protocol. Our experimental results indicate that Regional Locality exists in executions of many Distributed Shared Memory concurrent programs. We have shown that the proposed protocols outperform the existing updates propagation protocols based on temporal locality. Exploring Regional Locality in other shared memory systems would be an interesting future research direction

[1]  Liviu Iftode,et al.  Scope consistency: a bridge between release consistency and entry consistency , 1996, SPAA '96.

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

[3]  Alan L. Cox,et al.  Evaluation of release consistent software distributed shared memory on emerging network technology , 1993, ISCA '93.

[4]  Anoop Gupta,et al.  Memory consistency and event ordering in scalable shared-memory multiprocessors , 1990, ISCA '90.

[5]  Jeffrey Robert Spirn,et al.  Program locality and dynamic memory management. , 1973 .

[6]  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).

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

[8]  Alan L. Cox,et al.  Tradeoffs between false sharing and aggregation in software distributed shared memory , 1997, PPOPP '97.

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

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

[11]  Ricardo Bianchini,et al.  Data prefetching for software DSMs , 1998, ICS '98.

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

[13]  Abdul Sattar,et al.  Heuristic Diff Acquiring in Lazy Release Consistency Model , 1997, ASIAN.

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