Causal Consistency for Geo-Replicated Cloud Storage under Partial Replication

Proceedings - 2015 IEEE 29th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2015

Volumn , Issue , 2015, Pages 509-518

  Shen, Min ^a   Kshemkalyani, Ajay D ^a   Hsu, Ta Yuan ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

causal consistency; causality; cloud computing; distributed computing; geo replicated storage; replication

Indexed keywords

CLOUD COMPUTING; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS;

CAUSAL CONSISTENCY; CAUSALITY; DATA REPLICATION; PARTIAL REPLICATION; RELIABLE DISTRIBUTED SYSTEMS; REPLICATED STORAGE; REPLICATED SYSTEMS; REPLICATION;

DIGITAL STORAGE;

EID: 84962240073     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPSW.2015.68     Document Type: Conference Paper

References (28)

1. M. Ahamad, G. Neiger, J. Burns, P. Kohli, and P. Hutto. Causal memory: definitions, implementation and programming. Distributed Computing, 9, 1, pages 37-49, 1995.
2. S. Almeida, J. Leitao, and L. Rodrigues. ChainReaction: a causal+ consistent datastore based on chain replication. In ACM Eurosys, pp. 85-98, 2013.
3. P. Bailis, A. Fekete, A. Ghodsi, J.M. Hellerstein, and I. Stoica. The potential dangers of causal consistency and an explicit solution. In ACM SOCC, 2012.
4. P. Bailis, A. Ghodsi, J.M. Hellerstein, and I. Stoica. Bolt-on causal consistency. ACM SIGMOD, pp. 761-772, 2014.
5. R. Baldoni, A. Milani, and S. Piergiovanni. Optimal propagation-based protocols implementing causal memories. Distributed Computing, 18, 6, pages 461-474, 2006.
6. N. Belaramani, M. Dahlin, L. Gao, A. Venkataramani, P. Yalagandula, and J. Zheng. Practi replication. In NSDI, 2006.
7. P. Bernstein and S. Das. Rethinking eventual consistency. Proc. of the 2013 ACM SIGMOD International Conf. on Management of Data, 2013.
8. K. Birman. A response to Cheriton and Skeen's criticism of causally and totally ordered communication. In ACM SIGOPS Operating Systems Review, 28(1): 11-21, 1994.
9. P. Chandra, P. Gambhire, and A.D. Kshemkalyani. Performance of the optimal causal multicast algorithm: A statistical analysis. IEEE Transactions on Parallel and Distributed Systems, 15(1), pages 40-52, January 2004.
10. P. Chandra and A.D. Kshemkalyani. Causal multicast in mobile networks. Proc. of the 12th IEEE/ACM Symposium on Modelling, Analysis, and Simulation of Computer and Communication Systems, pages 213-220, 2004.
11. D.R. Cheriton and D. Skeen. Understanding the limitations of causally and totally ordered communication. In ACM SOSP, 1993.
12. G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels. Dynamo: Amazon's highly available keyvalue store. Proc. of the 19th ACM SOSP, pages 205-220, 2007.
13. J. Du, S. Elnikety, A. Roy, and W. Zwaenepoel. Orbe: Scalable causal Consistency using dependency matrices and physical clocks. In ACM SOCC, 2013.
14. J. Du, C. Iorgulescu, A. Roy, and W. Zwaenepoel. GentleRain: Cheap and scalable causal consistency with physical clocks. In ACM SOCC, 2014.
15. P. Gambhire and A.D. Kshemkalyani. Reducing false causality in causal message ordering. Proc. 7th International High Performance Computing Conference (HiPC), LNCS 1970, Springer, pp 61-72, 2000.
16. S. Gilbert and N. Lynch. Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services. ACM SIGACT News, 2002.
17. A.D. Kshemkalyani and M. Singhal. An optimal algorithm for generalized causal message ordering. Proc. of the 15th ACM Symposium on Principles of Distributed Computing (PODC), page 87, 1996.
18. A.D. Kshemkalyani and M. Singhal. Necessary and sufficient conditions on information for causal message ordering and their optimal implementation. Distributed Computing, 11, 2, pages 91-111, 1998.
19. A.D. Kshemkalyani and M. Singhal. Distributed Computing: Principles, Algorithms, and Systems. Cambridge University Press, 2008.
20. K. Lady, M. Kim, and B. Noble. Declared causality in wide-area replicated storage. In Workshop on Planetary-Scale Distributed Systems, 2014.
21. L. Lamport. Time, clocks and the ordering of events in a distributed system. Communications of the ACM, 21, pages 558-564, 1978.
22. W. Lloyd, M. Freedman, M. Kaminsky, and D. Andersen. Don't settle for eventual: Scalable causal consistency for wide-area storage with COPS. Proc. of the 23rd ACM SOSP, pages 401-416, 2011.
23. W. Lloyd, M. Freedman, M. Kaminsky, and D. Andersen. Stronger semantics for low latency geo-replicated storage. In NSDI, 2013.
24. P. Mahajan, L. Alvisi, and M. Dahlin. Consistency, availability, and convergence. Tech. Rep. TR-11-22, Univ. Texas at Austin, Dept. Comp. Sci., 2011.
25. K. Petersen, M. Spreitzer, D. Terry, M. Theimer, and A. Demers. Flexible update propagation for weakly consistent replication. In SOSP, 1997.
26. M. Raynal, A. Schiper, and S. Toueg. The causal ordering abstraction and a simple way to implement it. Information Processing Letters, 39, 6, pages 343-350, 1991.
27. M. Shen, A.D. Kshemkalyani, and T. Hsu. OPCAM: Optimal algorithms implementing causal memories in shared memory systems. In ICDCN, Jan 2015.
28. M. Shen, A.D. Kshemkalyani, and T. Hsu. OPCAM: Optimal algorithms implementing causal memories in shared memory systems. Technical Report, Univ. Illinois at Chicago, Dept. of Computer Science, 2014.