Robust data sharing with key-value stores

Proceedings of the International Conference on Dependable Systems and Networks

Volumn , Issue , 2012, Pages

  Bǎsescu, Cristina ^a   Cachin, Christian ^b   Eyal, Ittay ^c   Haas, Robert ^b   Sorniotti, Alessandro ^b   Vukolić, Marko ^d   Zachevsky, Ido ^c  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b IBM RESEARCH ZURICH   (Switzerland)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d EURECOM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

IF THERE ARE; ROBUST DATUM; SPACE COMPLEXITY; SPACE OVERHEAD; STORAGE OVERHEAD; STORAGE SYSTEMS; WAIT-FREE ALGORITHMS; WRITE OPERATIONS;

SEMANTICS;

ALGORITHMS;

EID: 84866635679     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DSN.2012.6263920     Document Type: Conference Paper

References (36)

1. 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 SOSP'07, 2007.
2. E. Anderson, X. Li, A. Merchant, M. A. Shah, K. Smathers, J. Tucek, M. Uysal, and J. J. Wylie, "Efficient eventual consistency in Pahoehoe, an erasure-coded key-blob archive," in DSN-DCCS'10, 2010.
3. A. Lakshman and P. Malik, "Cassandra: A decentralized structured storage system," SIGOPS Op. Sys. Review, vol. 44, pp. 35-40, 2010.
4. "Voldemort: A distributed database," http://project-voldemort. com/.
5. "Amazon S3 availability event: July 20, 2008," http://status.aws.amazon.com/s3-20080720.html, retrieved Dec. 6, 2011.
6. "Gmail back soon for everyone," http://gmailblog.blogspot.com/ 2011/02/gmail-back-soon-for-everyone.html, retrieved Dec. 6, 2011.
7. "Amazon gets 'black eye' from cloud outage," http://www.computerworld.com/s/article/9216064/Amazon-gets-black-eye-from-cloud- outage, retrieved Dec. 6, 2011.
8. D. K. Gifford, "Weighted voting for replicated data," in SOSP'79, 1979.
9. H. Attiya, A. Bar-Noy, and D. Dolev, "Sharing memory robustly in message-passing systems," J. ACM, vol. 42, no. 1, pp. 124-142, 1995.
10. H. Abu-Libdeh, L. Princehouse, and H. Weatherspoon, "RACS: a case for cloud storage diversity," in SoCC'10, 2010.
11. C. Cachin, R. Haas, and M. Vukolić, "Dependable services in the intercloud: Storage primer," IBM Research, Research Report RZ 3783, Oct. 2010.
12. J. K. Resch and J. S. Plank, "AONT-RS: Blending security and performance in dispersed storage systems," in FAST'11, 2011.
13. A. Bessani, M. Correia, B. Quaresma, F. André, and P. Sousa, "Depsky: Dependable and secure storage in a cloud-of-clouds," in EuroSys'11, 2011.
14. C. Cachin, R. Guerraoui, and L. Rodrigues, Introduction to Reliable and Secure Distributed Programming (Second Edition). Springer, 2011.
15. P. M. B. Vitányi and B. Awerbuch, "Atomic shared register access by asynchronous hardware (detailed abstract)," in FOCS'86, 1986.
16. E. Gafni and L. Lamport, "Disk Paxos," Dist. Comp., vol. 16, no. 1, pp. 1-20, 2003.
17. I. Abraham, G. Chockler, I. Keidar, and D. Malkhi, "Byzantine disk Paxos: Optimal resilience with Byzantine shared memory," Dist. Comp., vol. 18, no. 5, pp. 387-408, 2006.
18. M. P. Herlihy and J. M. Wing, "Linearizability: a correctness condition for concurrent objects," ACM Trans. on Prog. Lang. and Sys., vol. 12, pp. 463-492, July 1990.
19. C. Shao, E. Pierce, and J. L. Welch, "Multi-writer consistency conditions for shared memory objects," in DISC'03, 2003, pp. 106-120.
20. L. Lamport, "On interprocess communication," Dist. Comp., vol. 1, no. 2, pp. 77-101, 1986.
21. H. Attiya and J. Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics. John Wiley & Sons, 2004.
22. R. Geambasu, A. A. Levy, T. Kohno, A. Krishnamurthy, and H. M. Levy, "Comet: an active distributed key-value store," in OSDI'10, 2010.
23. C. Bǎsescu, C. Cachin, I. Eyal, R. Haas, A. Sorniotti, M. Vukolić, and I. Zachevsky, "Robust data sharing with key-value stores," IBM Research, Research Report RZ 3802, 2011.
24. N. A. Lynch and A. A. Shvartsman, "Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts," in FTCS'97, 1997.
25. S. Gilbert, N. Lynch, and A. Shvartsman, "Rambo: A re-configurable atomic memory service for dynamic networks," Dist. Comp., vol. 23, pp. 225-272, 2010.
26. B. Englert and A. A. Shvartsman, "Graceful quorum reconfiguration in a robust emulation of shared memory," in ICDCS'00, 2000.
27. P. Jayanti, T. D. Chandra, and S. Toueg, "Fault-tolerant wait-free shared objects," J. ACM, vol. 45, pp. 451-500, May 1998.
28. P. Dutta, R. Guerraoui, R. R. Levy, and M. Vukolic, "Fast access to distributed atomic memory," SIAM J. Comp., vol. 39, no. 8, pp. 3752-3783, 2010.
29. C. Georgiou, N. C. Nicolaou, and A. A. Shvartsman, "Fault-tolerant semifast implementations of atomic read/write registers," J. Parallel Dist. Comp., vol. 69, no. 1, pp. 62-79, 2009.
30. M. K. Aguilera, I. Keidar, D. Malkhi, and A. Shraer, "Dynamic atomic storage without consensus," J. ACM, vol. 58, pp. 7:1-7:32, April 2011.
31. G. Chockler and D. Malkhi, "Active disk Paxos with infinitely many processes," Dist. Comp., vol. 18, pp. 73-84, 2005.
32. Y. Ye, L. Xiao, I.-L. Yen, and F. Bastani, "Secure, dependable, and high performance cloud storage," in SRDS'10, 2010.
33. N. A. Lynch, Distributed Algorithms. Morgan Kaufmann, 1996.
34. M. Herlihy, "Wait-free synchronization," ACM Trans. Prog. Lang. and Sys., vol. 13, no. 1, pp. 124-149, 1991.
35. W. Vogels, "Eventually consistent," Comm. ACM, vol. 52, no. 1, pp. 40-44, 2009.
36. B. Calder, J. Wang, A. Ogus, N. Nilakantan, A. Skjolsvold, S. McKelvie et al., "Windows Azure Storage: A highly available cloud storage service with strong consistency," in SOSP'11, 2011.