skip to main content
10.1145/3225058.3225065acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicppConference Proceedingsconference-collections
research-article

Cross-Rack-Aware Updates in Erasure-Coded Data Centers

Published:13 August 2018Publication History

ABSTRACT

The update performance in erasure-coded data centers is often bottlenecked by the constrained cross-rack bandwidth. We propose CAU, a cross-rack-aware update mechanism that aims to mitigate the cross-rack update traffic in erasure-coded data centers. CAU builds on three design elements: (i) selective parity updates, which select the appropriate parity update approach based on the update pattern and the data layout to reduce the cross-rack update traffic; (ii) data grouping, which relocates and groups updated data chunks in the same rack to further reduce the cross-rack update traffic; and (iii) interim replication, which stores a temporary replica for each newly updated data chunk. We evaluate CAU via trace-driven analysis, local cluster experiments, and Amazon EC2 experiments. We show that CAU enhances state-of-the-arts by mitigating the cross-rack update traffic as well as maintaining high update performance in both local cluster and geo-distributed environments.

References

  1. 2011. HDFS RAID. http://wiki.apache.org/hadoop/HDFS-RAID. (2011).Google ScholarGoogle Scholar
  2. M. Aguilera, R. Janakiraman, and L. Xu. 2005. Using Erasure Codes Efficiently for Storage in a Distributed System. In Proc. of IEEE/IFIP DSN. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. F. Ahmad, S. Chakradhar, A. Raghunathan, and T. Vijaykumar. 2014. Shuffle-Watcher: Shuffle-aware Scheduling in Multi-tenant MapReduce Clusters. In Proc. of USENIX ATC. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. T. Benson, A. Akella, and D. Maltz. 2010. Network Traffic Characteristics of Data Centers in the Wild. In Proc. of ACM IMC. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. B. Calder, J. Wang, A. Ogus, et al. 2011. Windows Azure Storage: A Highly Available Cloud Storage Service with Strong Consistency. In Proc. of ACM SOSP. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Chan, Q. Ding, P. Lee, and H. Chan. 2014. Parity Logging with Reserved Space: Towards Efficient Updates and Recovery in Erasure-Coded Clustered Storage. In Proc. of USENIX FAST. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Y. Chen, S. Mu, J. Li, C. Huang, J. Li, A. Ogus, and D. Phillips. 2017. Giza: Erasure Coding Objects across Global Data Centers. In Proc. of USENIX ATC. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. M. Chowdhury, S. Kandula, and I. Stoica. 2013. Leveraging Endpoint Flexibility in Data-Intensive Clusters. In Proc. of ACM SIGCOMM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. A. Cidon, R. Escriva, S. Katti, M. Rosenblum, and E. Sirer. 2015. Tiered Replication: A Cost-effective Alternative to Full Cluster Geo-replication. In Proc. of USENIX ATC. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Peter Corbett, Bob English, Atul Goel, Tomislav Grcanac, Steven Kleiman, James Leong, and Sunitha Sankar. 2004. Row-diagonal Parity for Double Disk Failure Correction. In Proc. of USENIX FAST. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. D. Ford, F. Labelle, F. Popovici, M. Stokely, V. Truong, L. Barroso, C. Grimes, and S. Quinlan. 2010. Availability in Globally Distributed Storage Systems. In Proc. of USENIX OSDI. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. S. Frolund, A. Merchant, Y. Saito, S. Spence, and A. Veitch. 2004. A Decentralized Algorithm for Erasure-Coded Virtual Disks. In Proc. of IEEE/IFIP DSN. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. P. Gill, N. Jain, and N. Nagappan. 2011. Understanding Network Failures in Data Centers: Measurement, Analysis, and Implications. In Proc. of ACM SIGCOMM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Y. Hu, X. Li, M. Zhang, P. Lee, X. Zhang, P. Zhou, and D. Feng. 2017. Optimal Repair Layering for Erasure-Coded Data Centers: From Theory to Practice. ACM Trans. on Storage 13, 4 (2017). Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. C. Huang, H. Simitci, Y. Xu, A. Ogus, B. Calder, P. Gopalan, J. Li, and S. Yekhanin. 2012. Erasure Coding in Windows Azure Storage. In Proc. of USENIX ATC. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. V. Jalaparti, P. Bodik, I. Menache, S. Rao, K. Makarychev, and M. Caesar. 2015. Network-Aware Scheduling for Data-Parallel Jobs: Plan When You Can. In Proc. of ACM SIGCOMM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Geoffrey Lefebvre and Michael J. Feeley. 2004. Separating Durability and Availability in Self-Managed Storage. In Proc. of ACM SIGOPS European Workshop. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. H. Li, Y. Zhang, Z. Zhang, S. Liu, D. Li, X. Liu, and Y. Peng. 2017. PARIX: Speculative Partial Writes in Erasure-Coded Systems. In Proc. of USENIX ATC. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. R. Li, Y. Hu, and P. Lee. 2017. Enabling Efficient and Reliable Transition from Replication to Erasure Coding for Clustered File Systems. IEEE Trans. on Parallel and Distributed Systems 28, 9 (2017), 2500--2513.Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. S. Li, Q. Zhang, Z. Yang, and Y. Dai. 2017. BCStore: Bandwidth-Efficient In-memory KV-Store with Batch Coding. In Proc. of IEEE MSST.Google ScholarGoogle Scholar
  21. S. Muralidhar, W. Lloyd, S. Roy, et al. 2014. F4: Facebook's Warm Blob Storage System. In Proc. of USENIX OSDI. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Dushyanth Narayanan, Austin Donnelly, and Antony Rowstron. 2008. Write Off-loading: Practical Power Management for Enterprise Storage. ACM Trans. on Storage 4, Article 10 (2008), 23 pages. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. M. Ovsiannikov, S. Rus, D. Reeves, P. Sutter, S. Rao, and J. Kelly. 2013. The Quantcast File System. Proc. of the VLDB Endowment 6, 11 (2013), 1092--1101. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. X. Pei, Y. Wang, X. Ma, and F. Xu. 2016. T-Update: A Tree-structured Update Scheme with Top-down Transmission in Erasure-coded Systems. In Proc. of IEEE INFOCOM.Google ScholarGoogle Scholar
  25. J. Plank. 1997. A Tutorial on Reed-Solomon Coding for Fault-Tolerance in RAID-like Systems. Software - Practice & Experience 27, 9 (1997), 995--1012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. J. Plank, S. Simmerman, and C. Schuman. 2008. Jerasure: A Library in C/C++ Facilitating Erasure Coding for Storage Applications-Version 1.2. University of Tennessee, Tech. Rep. CS-08-627 23 (2008).Google ScholarGoogle Scholar
  27. K. Rashmi, N. Shah, D. Gu, H. Kuang, D. Borthakur, and K. Ramchandran. 2013. A Solution to the Network Challenges of Data Recovery in Erasure-coded Distributed Storage Systems: A Study on the Facebook Warehouse Cluster. In USENIX Workshop on HotStorage. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. I. Reed and G. Solomon. 1960. Polynomial Codes over Certain Finite Fields. Journal of the Society for Industrial & Applied Mathematics 8, 2 (1960), 300--304.Google ScholarGoogle ScholarCross RefCross Ref
  29. Maheswaran Sathiamoorthy, Megasthenis Asteris, Dimitris Papailiopoulos, Alexandros G Dimakis, Ramkumar Vadali, Scott Chen, and Dhruba Borthakur. 2013. Xoring Elephants: Novel Erasure Codes for Big Data. In Proc. of the VLDB Endowment, Vol. 6. 325--336. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. J. Schindler, S. Shete, and K. Smith. 2011. Improving Throughput for Small Disk Requests with Proximal I/O. In Proc. of USENIX FAST. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. R. Sears and R. Ramakrishnan. 2012. bLSM: A General Purpose Log Structured Merge Tree. In Proc. of ACM SIGMOD. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Z. Shen, P. Lee, J. Shu, and W. Guo. 2017. Correlation-Aware Stripe Organization for Efficient Writes in Erasure-Coded Storage Systems. In Proc. of IEEE SRDS.Google ScholarGoogle Scholar
  33. Z. Shen, J. Shu, and Y. Fu. 2016. Parity-switched Data Placement: Optimizing Partial Stripe Writes in XOR-Coded Storage Systems. IEEE Trans. on Parallel and Distributed Systems 27, 11 (Nov 2016), 3311--3322. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Z. Shen, J. Shu, and P. Lee. 2016. Reconsidering Single Failure Recovery in Clustered File Systems. In Proc. of IEEE/IFIP DSN.Google ScholarGoogle Scholar
  35. Gokul Soundararajan, Vijayan Prabhakaran, Mahesh Balakrishnan, and Ted Wobber. 2010. Extending SSD Lifetimes with Disk-Based Write Caches. In Proc. of USENIX FAST. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. D. Stodolsky, G. Gibson, and M. Holland. 1993. Parity Logging Overcoming the Small Write Problem in Redundant Disk Arrays. In Proc. of ISCA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. A. Vulimiri, C. Curino, P. Godfrey, T. Jungblut, J. Padhye, and G. Varghese. 2015. Global Analytics in the Face of Bandwidth and Regulatory Constraints. In Proc. of USENIX NSDI. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Hakim Weatherspoon and John D Kubiatowicz. 2002. Erasure Coding vs. Replication: A Quantitative Comparison. In Proc. of IPTPS. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Cross-Rack-Aware Updates in Erasure-Coded Data Centers

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        ICPP '18: Proceedings of the 47th International Conference on Parallel Processing
        August 2018
        945 pages
        ISBN:9781450365109
        DOI:10.1145/3225058

        Copyright © 2018 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 13 August 2018

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Research
        • Refereed limited

        Acceptance Rates

        ICPP '18 Paper Acceptance Rate91of313submissions,29%Overall Acceptance Rate91of313submissions,29%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader