Consistency Model and Synchronization Primitives in SDSMS

Authors: Dalvinder Singh Dhaliwal, Parvinder S. Sandhu, S. N. Panda

Abstract:

This paper is on the general discussion of memory consistency model like Strict Consistency, Sequential Consistency, Processor Consistency, Weak Consistency etc. Then the techniques for implementing distributed shared memory Systems and Synchronization Primitives in Software Distributed Shared Memory Systems are discussed. The analysis involves the performance measurement of the protocol concerned that is Multiple Writer Protocol. Each protocol has pros and cons. So, the problems that are associated with each protocol is discussed and other related things are explored.

Keywords: Distributed System, Single owner protocol, Multiple owner protocol

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1073098

References:

[1] S. V. Adve and K. Gharachorloo. Shared memory consistency models: A tutorial. Technical report, Rice University ECE, 1995.
[2] D. Bailey, E. Barszcz, J. Barton, D. Browning, R. Carter, L. Dagum, R. Fatoohi, S. Fineberg, P. Frederickson, T. Lasinski, R. Schreiber, H. Simon, V. Venkatakrishnan, and S. Weeratunga. the NAS parallel benchmarks. Technical Report RNR-94-007, NASA, 1994.
[3] J. B. Carter. Efficient Distributed Shared Memory Based on Multi- Protocol Release Consistency. PhD thesis, Rice University, 1993.
[4] J. B. Carter. Design of the Munin distributed shared memory system. Journal of Parallel and Distributed Computing on Distributed Shared Memory, 1995.
[5] M. Dubois and C. Scheurich. Memory access dependencies in sharedmemory multiprocessors. IEEE Transaction on Software Engineering, June 1990.
[6] K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and J. Hennessy. Memory consistency and event ordering in scalable sharedmemory multiprocessors. In the Proceedings of the 17th Annual International Symposium on Computer Architecture, 1990
[7] M. Dubois, C. Scheurich, and F. A. Briggs. Memory access buffering in multiprocessors. In Proceeding of 13th Annual International Symposium on Computer Architecture, 1986.
[8] J.R. Goodman. Cache consistency and sequential consistency. Technical Report 61, SCI Committee, 1989.
[9] P. Keleher, A. L. Cox, and W. Zwaenepoel. Lazy release consistency for software distributed shared memory. In the 19th Annual International Symposium on Computer Architecture, 1992.
[10] P. Keleher. Lazy Release Consistency for Distributed Shared Memory. PhD thesis, Rice University, January 1995.
[11] P.T.Koch, R. J. Fowler, and E. Jul. Message-driven relaxed consistency in a software distributed shared memory. In Proceedings of the First USENIX Symposium on Operating Systems Design and Implementation, 1994.
[12] L.Lamport. How to make a multiprocessor computer that correctly executes multi process programs. IEEE Transactions on Computers, 28(9):690{691, November 1979.
[13] A. S. Tanenbaum. Modern Operating Systems, chapter 2. Prentice Hall, 1992.
[14] C. Amza, A. L. Cox, S. Dwarkadas, P. Keleher, H. Lu, R. Raja-mony, W. Yu, and W. Zwaenepoel. TreadMarks: Shared memory computing on networks of workstations. IEEE Computer
[15] P. Keleher, A. L. Cox, S. Dwarkadas, and W. Zwaenepoel. Tread- Marks: Distributed shared memory on standard workstations and operating systems. In the 1994 Winter USENIX Conference, 1994.