Multi-version Coherence Protocol for Replicated Shared Objects
Sequential consistency is one of the strongest consistency models for replicated shared data. The performance of a system supporting this model is rather low, so weaker models are used to improve the efficiency. However, the construction of application for weaker models is more complicated. The idea of this approach is to provide the data to the application along with the consistency model to which they conform. This allows the application to decide about the quality of accessed data.
KeywordsConsistency Model Read Operation Shared Object Synchronisation Condition Local Consistency
Unable to display preview. Download preview PDF.
- 2.Saito, Y., Shapiro, M.: Optimistic replication. Technical Report MSR-TR-2003-60, Microsoft Research (2003)Google Scholar
- 3.Lipton, R.J., Sandberg, J.S.: PRAM: A scalable shared memory. Technical Report CS-TR-180-88, Dept. of Computer Science, Princeton University (1988)Google Scholar
- 4.Goodman, J.R.: Cache consistency and sequential consistency. Technical Report 61, IEEE Scalable Coherence Interface Working Group (1989)Google Scholar
- 5.Ahamad, M., Bazzi, R.A., John, R., Kohli, P., Neiger, G.: The power of processor consistency (extended abstract). In: Proc. of the 5th ACM Annual Symp. on Parallel Algorithms and Architectures (SPAA 1993), pp. 251–260 (1993)Google Scholar
- 7.Friedman, R.: Consistency Conditions for Distributed Shared Memories. PhD thesis, Computer Science Department, Technion–Israel Institute of Technology (1994)Google Scholar
- 8.Agrawal, D., Choy, M., Leong, H.V., Singh, A.K.: Mixed consistency: A model for parallel programming. In: Proc. of the 13th Annual ACM Symp. on Principles of Distributed Computing (PODC 1994), pp. 101–110 (1994)Google Scholar
- 9.Wawrzyniak, D.: Complex Consistency Models of Distributed Shared Memory and their Application to Mutual Exclusion Algorithms. PhD thesis, Institute of Computing Science, Poznan University of Technology (2000)Google Scholar
- 10.Brzeziński, J., Kobusiński, J., Wawrzyniak, D.: Multi-version approach to the consistency of replicated shared objects. Technical Report RA-007/05, Institute of Computing Science, Poznan University of Technology (2005)Google Scholar
- 11.Adve, S.V., Hill, M.D.: Weak ordering—a new definition. In: Proc. of the 17th Annual Int. Symp. on Computer Architecture (ISCA 1990), pp. 2–14 (1990)Google Scholar
- 12.Bennett, J.K., Carter, J.B., Zwaenepoel, W.: Munin: Shared memory for distributed memory multiprocessors. Technical Report COMP TR89-91, Dept.of Computer Science, Rice University (1989)Google Scholar
- 13.Keleher, P.: Lazy Release Consistency for Distributed Shared Memory. PhD thesis, Department of Computer Science, Rice University (1994)Google Scholar
- 14.Bershad, B.N., Zekauskas, M.J.: Shared memory parallel programming with entry consistency for distributed memory multiprocessors. Technical Report CMU-CS-91-170, School of Computer Science, Carnegie-Mellon University (1991)Google Scholar