Advertisement

Heuristic Diff Acquiring in lazy release consistency model

  • Zhiyi Huang
  • Wan-Ju Lei
  • Chengzheng Sun
  • Abdul Sattar
Session 2
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1345)

Abstract

This paper presents a Heuristic Diff Acquiring (HDA) protocol in Lazy Release Consistency (LRC based distributed shared memory (DSM) systems. Based on the run-time detection of associations between locks and data, the HDA can selectively piggy-back useful page diffs in a lock grant message. By adopting the novel HDA protocol, an improved LRC model has been implemented, and the experimental results have been collected and analyzed. First, we introduce the Lazy Diff Acquiring (LDA) and Eager Diff Acquiring (EDA) protocols in the LRC based DSM systems. Second, we discuss the impact of LDA and EDA on the performance of the LRC-based DSM systems. Third, we propose the idea and implementation of the HDA protocol. Finally, we present and analyze the experimental results. From the experimental results, we conclude the HDA protocol can significantly improve the performance of LRC model.

Key Words

Distributed Shared Memory Lazy Release Consistency Eager Release Consistency 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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, S. Dwarkadas, and W. Zwaenepoel: “Software DSM Protocols that Adapt between Single Writer and Multiple Writer,” In Proc. of the Third High Performance Computer Architecture Conference, pp. 261–271, Feb. 1997.Google Scholar
  3. 3.
    J.K. Bennett, et al: “Munin: Distributed shared memory based on type-specific memory coherence,” In Proceedings of the Second ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, Pages 168–176, March 1990.Google Scholar
  4. 4.
    B.N. Bershad, et al: “The Midway Distributed Shared Memory System,” Proc. IEEE COMPCON Conf., IEEE, pp528–537, 1993.Google Scholar
  5. 5.
    K. Gharachorloo, et al: “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
  6. 6.
    Zhiyi Huang, Chengzheng Sun, Abdul Sattar, and Wanzu Lei: “Parallel Logic Programming on Distributed Shared Memory System,” In Proc. of the IEEE International Conference on Intelligent Processing Systems, Oct., 1997.Google Scholar
  7. 7.
    P. Keleher: “Lazy Release Consistency for Distributed Shared Memory,” Ph.D. Thesis, Rice Univ., 1995.Google Scholar
  8. 8.
    P. Keleher, A.L. Cox, S. Dwarkadas, and W. Zwaenepoel: “An Evaluation of Software-Based Release Consistent Protocols,” Journal of Parallel and Distributed Computing, Special Issue on Distributed Shared Memory, Vol. 29, pp.126–141, Oct. 1995.Google Scholar
  9. 9.
    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
  10. 10.
    K.Li, P.Hudak: “Memory Coherence in Shared Virtual Memory Systems,” ACM Trans. on Computer Systems, Vol. 7, pp321–359, Nov. 1989.CrossRefGoogle Scholar
  11. 11.
    H. Lu, S. Dwarkadas, A.L. Cox, and W. Zwaenepoel: “Message Passing Versus Distributed Shared Memory on Networks of Workstations,” In Proc. of Supercomputing '95, Dec. 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Zhiyi Huang
    • 1
  • Wan-Ju Lei
    • 1
  • Chengzheng Sun
    • 1
  • Abdul Sattar
    • 1
  1. 1.Knowledge Representation and Reasoning Unit School of Computing & Information TechnologyGriffith UniversityNathanAustralia

Personalised recommendations