Consistency Management in Cloud Storage Systems - Large Scale and Big Data: Processing and Management - page 353

20. C. Scheurich, and M. Dubois, “Concurrent miss resolution in multiprocessor caches,” in
ICPP (1) , pp. 118-125, 1988.
21. S. V. Adve, and M. D. Hill, “Weak ordering—A new definition,” SIGARCH Comput.
Archit. News , vol. 18, no. 3a, pp. 2-14, 1990.
22. R. Bisiani, A. Nowatzyk, and M. Ravishankar, “Coherent shared memory on a distrib-
uted memory machine,” in ICPP (1) , pp. 133-141, 1989.
23. W. Vogels, “Eventually consistent,” Commun. ACM , vol. 52, no. 1, pp. 40-44, 2009.
24. M. Shapiro, and B. Kemme, “Eventual Consistency,” in Encyclopedia of Database
Systems (online and print), M. T. Ozsu and L. Liu, Eds. Springer US, 2009.
25. A. S. Tanenbaum, and M. V. Steen, Distributed Systems: Principles and Paradigms ,
(2nd Edition). Upper Saddle River, NJ, USA: Prentice-Hall, Inc., 2006.
26. Y. Saito, and M. Shapiro, “Optimistic replication,” ACM Comput. Surv. , vol. 37, no. 1,
pp. 42-81, 2005.
27. M. Ahamad, G. Neiger, J. E. Burns, P. Kohli, and P. W. Hutto, “Causal memory:
Definitions, implementation, and programming,” Distrib. Comput. , vol. 9, no. 1,
pp. 37-49, 1995.
28. W. Lloyd, M. J. Freedman, M. Kaminsky, and D. G. Andersen, “Don't settle for even-
tual: Scalable causal consistency for wide-area storage with cops,” in Proceedings of the
Twenty-Third ACM Symposium on Operating Systems Principles , ser. SOSP'11, New
York, USA: ACM, pp. 401-416, 2011.
29. R. H. Thomas, “A majority consensus approach to concurrency control for multiple
copy databases,” ACM Trans. Database Syst. , vol. 4, no. 2, pp. 180-209, June 1979.
30. W. Lloyd, M. J. Freedman, M. Kaminsky, and D. G. Andersen, “Stronger semantics for
low-latency geo-replicated storage,” in Proceedings of the 10th USENIX Conference
on Networked Systems Design and Implementation , ser. nsdi'13, Berkeley, CA, USA:
USENIX Association, pp. 313-328, 2013.
31. B. F. Cooper, R. Ramakrishnan, U. Srivastava, A. Silberstein, P. Bohannon, H.-A.
Jacobsen, N. Puz, D. Weaver, and R. Yerneni, “Pnuts: Yahoo!'s hosted data serving plat-
form,” Proc. VLDB Endow. , vol. 1, no. 2, pp. 1277-1288, 2008.
32. G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S.
Sivasubramanian, P. Vosshall, and W. Vogels, “Dynamo: Amazon's highly available key-
value store,” in Proceedings of Twenty-First ACM SIGOPS Symposium on Operating
Systems Principles , ser. SOSP'07, New York, USA: ACM, pp. 205-220, 2007.
33. D. Karger, E. Lehman, T. Leighton, R. Panigrahy, M. Levine, and D. Lewin, “Consistent
hashing and random trees: Distributed caching protocols for relieving hot spots on the
world wide web,” in Proceedings of the Twenty-Ninth Annual ACM Symposium on
Theory of Computing , ser. STOC'97, New York, USA: ACM, pp. 654-663, 1997.
34. A. Lakshman, and P. Malik, “Cassandra: A decentralized structured storage system,”
SIGOPS Oper. Syst. Rev. , vol. 44, pp. 35-40, 2010.
35. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, “Chord: A scal-
able peer-to-peer lookup service for internet applications,” in Proceedings of the 2001
Conference on Applications, Technologies, Architectures, and Protocols for Computer
Communications , ser. SIGCOMM'01, New York, USA: ACM, 2001, pp. 149-160.
36. P. Hunt, M. Konar, F. P. Junqueira, and B. Reed, “Zookeeper: Wait-free coordination for
internet-scale systems,” in Proceedings of the 2010 USENIX Conference on USENIX
Annual Technical Conference , ser. USENIXATC'10, Berkeley, CA, USA: USENIX
Association, pp. 11-11, 2010.
37. “About Data Consistency in Cassandra,” February 2012. [Online]. Available: http://
www.datastax.com/docs/1.0/dml/data_consistency.
38. “Riak,” February 2013. [Online]. Available: http://basho.com/riak/.
39. “Voldemort,” February 2013. [Online]. Available: http://www.project-voldemort.com/
voldemort/.