Exploring Regional Locality in Distributed Shared Memory

  • Zhiyi Huang
  • Chengzheng Sun
  • Abdul Sattar
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1538)


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

Key Words

Distributed Shared Memory Temporal Locality Regional Locality 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    C. Amza, et al: “TreadMarks: Shared memory computing on networks of workstations,” IEEE Computer, 29(2):18–28, February 1996.Google Scholar
  2. 2.
    C. Amza, A.L. Cox, K. Rajamani, and W. Zwaenepoel: “Tradeoffs between False Sharing and Aggregation in Software Distributed Shared Memory”, In Proc. of the Sixth Conference on Principles and Practice of Parallel Programming, pp. 90–99, June 1997.Google Scholar
  3. 3.
    B.N. Bershad, et al: “The Midway Distributed Shared Memory System,” In Proc. of IEEE COMPCON Conference, pp528–537, 1993.Google Scholar
  4. 4.
    R. Bianchini, R. Pinto, and C.L. Amorim: “Data prefetching for software DSMs”, In Proc. of the 12th ACM international Conference on Supercomputing, July 1998.Google Scholar
  5. 5.
    J.B. Carter, J.K. Bennett, and W. Zwaenepoel: “Techniques for reducing consistency-related information in distributed shared memory systems,” ACM Transactions on Computer Systems, 13(3):205–243, August 1995.Google Scholar
  6. 6.
    M. Dubois, C. Scheurich, and F.A. Briggs: “Memory access buffering in multiprocessors,” In Proc. of the 13th Annual International Symposium on Computer Architecture, pp. 434–442, June 1986.Google Scholar
  7. 7.
    S. Dwarkadas, et al: “Evaluation of Release Consistent Software Distributed Shared Memory on Emerging Network Technology”, In Proc. of the 20th Symposium on Computer Architecture, pp. 144–155, May 1993.Google Scholar
  8. 8.
    K. Gharachorloo, D. Lenoski, J. Laudon: “Memory consistency and event ordering in scalable shared memory multiprocessors,” In Proc. of the 17th Annual International Symposium on Computer Architecture, pp15–26, May 1990.Google Scholar
  9. 9.
    Zhiyi Huang, Wan-Ju Lei, Chengzheng Sun, and Abdul Sattar: “Heuristic Diff Acquiring in Lazy Release Consistency Model,” In Proc. of 1997 Asian Computing Science Conference (ASIAN’97), LNCS 1345, Springer-Verlag, pp98–109, Dec. 1997.Google Scholar
  10. 10.
    L. Iftode, J.P. Singh and K. Li: “Scope Consistency: A Bridge between Release Consistency and Entry Consistency,” In Proc. of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996.Google Scholar
  11. 11.
    P. Keleher: “Lazy Release Consistency for Distributed Shared Memory,” Ph.D. Thesis, Rice Univ., 1995.Google Scholar
  12. 12.
    L. Lamport: “How to make a multiprocessor computer that correctly executes multiprocess programs,” IEEE Transactions on Computers, 28(9):690–691, September 1979.Google Scholar
  13. 13.
    J.R. Spirn: “Program Locality and Dynamic Memory Management,” PhD thesis, Princeton University, 1973.Google Scholar
  14. 14.
    Chengzheng Sun, Zhiyi Huang, Wan-Ju Lei, and Abdul Sattar: “Toward Transparent Selective Sequential Consistency in Distributed Shared Memory Systems,” In Proc. of the 18th IEEE International Conference on Distributed Computing Systems, pp. 572–581, Amsterdam, May 1998.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Zhiyi Huang
    • 1
  • Chengzheng Sun
    • 1
  • Abdul Sattar
    • 2
  1. 1.School of Computing & Information TechnologyGriffith UniversityBrisbaneAustralia
  2. 2.Dept. of Computer ScienceDunedinNew Zealand

Personalised recommendations