CopySets: Reducing the frequency of data loss in cloud storage

Proceedings of the 2013 USENIX Annual Technical Conference, USENIX ATC 2013

Volumn , Issue , 2019, Pages 37-48

  Cidon, Asaf ^a   Rumble, Stephen M ^a   Stutsman, Ryan ^a   Katti, Sachin ^a   Ousterhout, John ^a   Rosenblum, Mendel ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OPEN SYSTEMS; OUTAGES; PROBABILITY;

CLOUD STORAGES; DATA CENTERS; LOW OVERHEAD; NODE FAILURE; OPEN SOURCE DATUM; PARALLEL DATA; REPLICATION TECHNIQUES; STORAGE SYSTEMS;

DIGITAL STORAGE;

EID: 85077196988     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. HDFS RAID. http://wiki.apache.org/hadoop/ HDFS-RAID.
2. Intelligent block placement policy to decrease probability of data loss. https://issues.apache.org/jira/browse/ HDFS-1094.
3. L. A. Barroso. Personal Communication, 2013.
4. L. A. Barroso and U. Hölzle. The case for energy-proportional computing. Computer, 40(12):33-37, Dec. 2007.
5. D. Borthakur, J. Gray, J. S. Sarma, K. Muthukkaruppan, N. Spiegelberg, H. Kuang, K. Ranganathan, D. Molkov, A. Menon, S. Rash, R. Schmidt, and A. Aiyer. Apache hadoop goes realtime at Facebook. In Proceedings of the 2011 international conference on Management of data, SIGMOD'11, pages 1071-1080, New York, NY, USA, 2011. ACM.
6. B. Calder, J. Wang, A. Ogus, N. Nilakantan, A. Skjolsvold, S. McKelvie, Y. Xu, S. Srivastav, J. Wu, H. Simitci, J. Haridas, C. Uddaraju, H. Khatri, A. Edwards, V. Bedekar, S. Mainali, R. Abbasi, A. Agarwal, M. F. U. Haq, M. I. U. Haq, D. Bhardwaj, S. Dayanand, A. Adusumilli, M. McNett, S. Sankaran, K. Manivannan, and L. Rigas. Windows Azure Storage: a highly available cloud storage service with strong consistency. In Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles, SOSP'11, pages 143-157, New York, NY, USA, 2011. ACM.
7. R. J. Chansler. Data Availability and Durability with the Hadoop Distributed File System. ;login: The USENIX Magazine, 37(1), February 2012.
8. R. J. Chansler. Personal Communication, 2013.
9. W. Cochran and G. Cox. Experimental designs . 1957.
10. J. Dean. Evolution and future directions of large-scale storage and computation systems at Google. In SoCC, page 1, 2010.
11. B. Fan, W. Tantisiriroj, L. Xiao, and G. Gibson. DiskReduce: Replication as a prelude to erasure coding in data-intensive scalable computing, 2011.
12. R. Fisher. An examination of the different possible solutions of a problem in incomplete blocks. Annals of Human Genetics, 10(1):52-75, 1940.
13. D. Ford, F. Labelle, F. I. Popovici, M. Stokely, V.-A. Truong, L. Barroso, C. Grimes, and S. Quinlan. Availability in globally distributed storage systems. In Proceedings of the 9th USENIX conference on Operating systems design and implementation, OSDI'10, pages 1-7, Berkeley, CA, USA, 2010. USENIX Association.
14. S. Ghemawat, H. Gobioff, and S.-T. Leung. The Google file system. In SOSP, pages 29-43, 2003.
15. B. gon Chun, F. Dabek, A. Haeberlen, E. Sit, H. Weatherspoon, M. F. Kaashoek, J. Kubiatowicz, and R. Morris. Efficient replica maintenance for distributed storage systems. In IN PROC. OF NSDI, pages 45-58, 2006.
16. A. Haeberlen, A. Mislove, and P. Druschel. Glacier: Highly durable, decentralized storage despite massive correlated failures. In IN PROC. OF NSDI, 2005.
17. D. Harnik, D. Naor, and I. Segall. Low power mode in cloud storage systems.
18. S. Houghten, L. Thiel, J. Janssen, and C. Lam. There is no (46, 6, 1) block design*. Journal of Combinatorial Designs, 9(1):60-71, 2001.
19. P. Kaski and P. Östergård. There exists no (15, 5, 4) RBIBD. Journal of Combinatorial Designs, 9(3):227-232, 2001.
20. J. Koo and J. Gill. Scalable constructions of fractional repetition codes in distributed storage systems. In Communication, Control, and Computing (Allerton), 2011 49th Annual Allerton Conference on, pages 1366-1373. IEEE, 2011.
21. J. Leverich and C. Kozyrakis. On the energy (in)efficiency of hadoop clusters. SIGOPS Oper. Syst. Rev., 44(1):61-65, Mar. 2010.
22. K. Mathukkaruppan. Personal Communication, 2012.
23. M. D. Mitzenmacher. The power of two choices in randomized load balancing. Technical report, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1996.
24. D. Ongaro, S. M. Rumble, R. Stutsman, J. K. Ousterhout, and M. Rosenblum. Fast crash recovery in RAMCloud. In SOSP, pages 29-41, 2011.
25. K. Shvachko, H. Kuang, S. Radia, and R. Chansler. The hadoop distributed file system. Mass Storage Systems and Technologies, IEEE / NASA Goddard Conference on, 0:1-10, 2010.
26. D. Stinson. Combinatorial designs: construction and analysis. Springer, 2003.
27. E. Thereska, A. Donnelly, and D. Narayanan. Sierra: practical power-proportionality for data center storage. Proceedings of Eurosys 11, pages 169-182, 2011.
28. H. Yu, P. B. Gibbons, and S. Nath. Availability of multi-object operations. In Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3, NSDI'06, pages 16-16, Berkeley, CA, USA, 2006. USENIX Association.