Efficient eventual consistency in Pahoehoe, an erasure-coded key-blob archive

Proceedings of the International Conference on Dependable Systems and Networks

Volumn , Issue , 2010, Pages 181-190

  Anderson, Eric ^a   Li, Xiaozhou ^a   Merchant, Arif ^a   Shah, Mehul A ^a   Smathers, Kevin ^a   Tucek, Joseph ^a   Uysal, Mustafa ^a   Wylie, Jay J ^a  

^a Hew Lett Packard Laboratories   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLOUD COMPUTING; CLOUD STORAGES; DECENTRALIZED PROTOCOLS; ERASURE CODES; EVENTUAL CONSISTENCY; HIGH AVAILABILITY; HIGH RELIABILITY; LARGE OBJECTS; LOW COSTS; MULTIPLE DATA; NETWORK PARTITIONS;

DISTRIBUTED COMPUTER SYSTEMS;

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

References (29)

1. M. Abd-El-Malek, et al. Ursa Minor: Versatile cluster-based storage. In FAST'05, pages 59-72, December 2005.
2. M. K. Aguilera, W. Chen, and S. Toueg. Failure detection and consensus in the crash-recovery model. Distributed Computing, 13(2):99-125, 2000.
3. R. Baldoni, et al. Unconscious eventual consistency with gossips. In Proceedings of the Eighth International Symposium on Stabilization, Safety and Security of Distributed Systems, pages 65-81. Springer, 2006.
4. C. Cachin and S. Tessaro. Optimal resilience for erasure-coded Byzantine distributed storage. In DSN'06, pages 115-124, June 2006.
5. Cassandra. Available at http://incubator.apache.org/cassandra/. Accessed December 2009.
6. J. Dean. Designs, lessons and advice from building large distributed systems. Keynote slides at http://www.cs.cornell.edu/projects/ladis2009/talks/ dean-keynote-ladis2009.pdf Accessed December 2009.
7. G. DeCandia, et al. Dynamo: Amazon's highly available key-value store. In SOSP'07, pages 205-220, October 2007.
8. J. R. Douceur and J. Howell. Distributed directory service in the farsite file system. In OSDI'06, pages 321-334, November 2006.
9. C. Dwork, N. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, 35(2):288-323, 1988.
10. R. T. Fielding and R. N. Taylor. Principled design of the modem Web architecture. ACM Transactions on Internet Technology, 2(2): 115-150, 2002.
11. S. Ghemawat, H. Gobioff, and S.-T. Leung. The Google file system. In SOSP'03, pages 29-43, October 2003.
12. G. A. Gibson, et al. A cost-effective, high-bandwidth storage architecture. In ASPLOS'98, pages 92-103, October 1998.
13. S. Gilbert and N. Lynch. Brewer's conjecture and the feasibility of consistent, available, partition-tolerant Web services. ACM SIGACT News, 33(2):51-59, June 2002.
14. G. Goodson, et al. Efficient Byzantine-tolerant erasure-coded storage. In DSN'04, pages 135-144, June 2004.
15. L. Lamport. On interprocess communication, Part I: Basic formalism and Part II: Algorithms. Distributed Computing, 1(2):77-101, June 1986.
16. F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes. North Holland, Amsterdam, 1978.
17. D. L. Mills. Network time synchronization research project. Available at http://www.cis.udel.edu/∼mills/ntp.html. Accessed December 2009.
18. E. Pierce and L. Alvisi. A framework for semantic reasoning about byzantine quorum systems. In PODC'O1, pages 317319, August 2001.
19. J. S. Plank, et al. A performance evaluation and examination of open-source erasure coding libraries for storage. In FAST'09, February 2009.
20. G. J. Popek, et al. Replication in Ficus distributed file systems. In Proceedings of the Workshop on Management of Replicated Data, pages 20-25. IEEE, November 1990.
21. S. Rhea, et al. Pond: The OceanStore prototype. In FAST'03, pages 1-14, March 2003.
22. A. Rowstron and P. Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In SOSP'O1, pages 188-201, October 2001.
23. Y. Saito, et al. FAB: Building distributed enterprise disk arrays from commodity components. In ASPLOS'04, pages 48-58, October 2004.
24. Y. Saito, et al. Taming aggressive replication in the Pangaea wide-area file system. In OSDI'02, pages 15-30, December 2002.
25. M. Satyanarayanan, et al. Coda: A highly available file system for a distributed workstation environment. IEEE Transactions on Computers, 39(4):447-459, 1990. (Pubitemid 20702255)
26. J. Stribling, et al. Flexible, wide-area storage for distributed systems with WheelFS. In NSDI'09, pages 43-58, April 2009.
27. D. B. Terry, et al. Managing update conflicts in Bayou, a weakly connected replicated storage system. In SOSP'95, pages 172-183, 1995.
28. Tokyo cabinet. Available at http://1978th.net/tokyocabinet/. Accessed December 2009.
29. W. Vogels. Eventually consistent. Communications of the ACM, 52(1):40-44, 2009.