View-based consistency and its implementation

This paper proposes a novel View-based Consistency model for Distributed Shared Memory. A view is a set of ordinary data objects that a processor has the right to access in a data-race-free program. The View-based Consistency model only requires that the data objects of a view are updated before a processor accesses them. Compared with other memory consistency models, the View-based Consistency model can achieve data selection without user annotation and can reduce much false-sharing effect. This model has been implemented based on TreadMarks. Performance results have shown that for all our applications the View-based Consistency model outperforms the Lazy Release Consistency model.Unpublished[1] C. Amza, et al.: “TreadMarks: Shared memory computing on networks of workstations”, IEEE Computer, 29(2), pp.18-28, February 1996. [2] B.N. Bershad, et al.: “Shared Memory Parallel Programming with Entry Consistency for Distributed Memory Multiprocessors”, CMU Technical Report CMU-CS-91-170, September 1991. [3] B.N. Bershad, et al.: “The Midway Distributed Shared Memory System”, In Proc. of IEEE COMPCON Conference, pp.528-537, 1993. [4] J.B. Carter, J.K. Bennett, and W. Zwaenepoel: “Implementation and performance of Munin”, In Proceedings of the 13th ACM Symposium on Operating Systems Principles, pp.152-164, Oct. 1991. [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), pp.205-243, August 1995. [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. [7] S. Dwarkadas, et al.: “An Integrated Compile-Time/Run-Time Software Distributed Shared Memory System”, In Proc. of the Seventh Symposium on Architectural Support for Programming Languages and Operating Systems, Oct. 1996. [8] B. Fleisch and R.H. Katz: “Mirage: A coherent distributed shared memory design”, In Proc. of the 12th ACM Symposium on Operating Systems Principles, pp.211-223, Dec. 1989. [9] 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, pp.15-26, May 1990. [10] Z. Huang, W.-J. Lei, C. Sun, and A. Sattar: “Heuristic Diff Acquiring in Lazy Release Consistency Model”, in Proc. of 1997 Asian Computing Science Conference, Lecture Notes in Computer Science 1345, pp.98-109, Springer Verlag, 1997. [11] Z. Huang, C. Sun, S. Cranefield, and M. Purvis: “Overview of weak sequential consistency models for distributed shared memory”, in Proc. of the 10th International Conference on Computing and Information, November 2000. [12] Z. Huang, C. Sun, M. Purvis, and S. Cranefield: “View-based Consistency and False Sharing Effect in Distributed Shared Memory”, Operating Systems Review, 35(2), April 2001. [13] 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. [14] P. Keleher: “Lazy Release Consistency for Distributed Shared Memory”, Ph.D. Thesis, Dept of Computer Science, Rice Univ., 1995. [15] L. Lamport: “How to make a multiprocessor computer that correctly executes multiprocess programs”, IEEE Transactions on Computers, 28(9), pp.690-691, September 1979. [16] K. Li, P. Hudak: “Memory Coherence in Shared Virtual Memory Systems”, ACM Trans. on Computer Systems, Vol. 7, pp.321-359, Nov. 1989. [17] D. Mosberger: “Memory consistency models”, Operating Systems Review, 17(1), pp.18-26, Jan. 1993. [18] C.B. Seidel, R. Bianchini, and C.L. Amorim: “The Affinity Entry Consistency Protocol”, In Proc. of the 1997 International Conference on Parallel Processing, August 1997. [19] C. Sun, Z. Huang, W.-J. Lei, and A. Sattar: “Towards 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