STAR: An efficient coding scheme for correcting triple storage node failures

FAST 2005 - 4th USENIX Conference on File and Storage Technologies

Volumn , Issue , 2005, Pages 197-210

  Huang, Cheng ^a   Xu, Lihao ^b  

^a MICROSOFT RESEARCH   (United States)

^b WAYNE STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECODING; OPTIMAL SYSTEMS; STARS;

DATA STORAGE SYSTEMS; DECODING ALGORITHM; DECODING COMPLEXITY; ERASURE CORRECTING; ERASURE CORRECTING CODES; LOW DECODING COMPLEXITY; PRACTICAL SYSTEMS; STORAGE SYSTEMS;

DIGITAL STORAGE;

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

References (44)

1. G. A. Alvarez, W. A. Burkhard, and F. Christian, “Tolerating multiple failures in RAID architectures with optimal storage and uniform declustering,” Proc. of the 24th Annual Symposium on Computer Architecture pgs. 62-72, 1997.
2. T. E. Anderson, D.E. Culler and D.A. Patterson, “A Case for NOW (Networks of Workstations),” IEEE Micro, 15(1), 54–64, 1995.
3. T. Anderson, M. Dahlin, J. Neefe, D. Patterson, D. Roselli and R. Wang, “Serverless Network File Systems”, ACM Trans. on Computer Systems, 41-79, Feb. 1996.
4. A. Bhide, E. Elnozahy and S. Morgan, “A Highly Available Network File Server”, Proc. of the Winter 1991 USENIX Technical Conf., 199-205, Jan. 1991.
5. M. Blaum, J. Brady, J. Bruck and J. Menon, “EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures,” IEEE Trans. on Computers, 44(2), 192-202, Feb. 1995.
6. M. Blaum, J. Brady, J. Bruck, J. Menon, and A. Vardy, “The EVENODD code and its generalization,” in High Performance Mass Storage and Parallel I/O, pp. 187–208. John Wiley & Sons, INC., 2002.
7. M. Blaum, J. Bruck, and A. Vardy, “MDS array codes with independent parity symbols,” IEEE Trans. Information Theory, vol. 42, no. 2, pp. 529–542, Mar. 1996.
8. M. Blaum, R. M. Roth, “New Array Codes for Multiple Phased Burst Correction,” IEEE Trans. on Information Theory, 39(1), 66-77, Jan. 1993.
9. M. Blaum, R. M. Roth, “On Lowest-Density MDS Codes,” IEEE Trans. on Information Theory, 45(1), 46-59, Jan. 1999.
10. J. Blomer, M. Kalfane, R. Karp, M. Karpinski, M. Luby, and D. Zuckerman, “An XOR-based erasure-resilient coding scheme,” Technical Report No. TR-95-048, ICSI, Berkeley, California, Aug. 1995.
11. J. Blomer, M. Kalfane, R. Karp, M. Karpinski, M. Luby, and D. Zuckerman, http://www.icsi.berkeley.edu/∼luby/cauchy.tar.uu
12. V. Bohossian, C. Fan, P. LeMahieu, M. Riedel, L. Xu and J. Bruck, “Computing in the RAIN: A Reliable Array of Independent Node”, IEEE Trans. on Parallel and Distributed Systems, Special Issue on Dependable Network Computing, 12(2), 99-114, Feb. 2001.
13. M. Castro and B. Liskov, “Practical Byzantine Fault Tolerance”, Operating Systems Review, ACM Press, NY, 173-186, 1999.
14. P. M. Chen, E. K. Lee, G. A. Gibson, R. H. Katz, D. A. Patterson, “Raid – High-Performance, Reliable Secondary Storage,” ACM Computing Surveys, 26(2), 145–185, 1994.
15. P. Corbett, B. English, A. Goel, T. Grcanac, S. Kleiman, J. Leong and S. Sankar, “Row-Diagonal Parity for Double Disk Failure Correction”, Proc. of USENIX FAST 2004, Mar. 31 to Apr. 2, San Francisco,CA, USA.
16. C. Fan and J. Bruck, “The Raincore API for Clusters of Networking Elements”, IEEE Internet Computing, 5(5), 70-76, Sep./Oct., 2001.
17. P. G. Farrell, “A Survey of Array Error Control Codes,” ETT , 3(5), 441-454, 1992.
18. Sanjay Ghemawat, Howard Gobioff, and Shun-Tak Leung “The Google File System”, Proc. of 19th ACM Symposium on Operating Systems Principles, Lake George, NY, October, 2003, pp. 29 - 43
19. G. A. Gibson and R. van Meter, “Network Attached Storage Architecture”, Communications of the ACM, 43(11), 37-45, Nov. 2000.
20. G. A. Gibson, D. Stodolsky, F. W. Chang, W. V. Courtright II, C. G. Demetriou, E. Ginting, M. Holland, Q. Ma, L. Neal, R. H. Patterson, J. Su, R. Youssef and J. Zelenka, “The Scotch Parallel Storage Systems,” Proceedings of the IEEE CompCon Conference, 1995.
21. A. V. Goldberg and P. N. Yianilos, “Towards an Archival Intermemory”, Proc. of IEEE Advances in Digital Libraries, Apr. 1998.
22. R. M. Goodman, R. J. McEliece and M. Sayano, “Phased Burst Error Correcting Arrays Codes,” IEEE Trans. on Information Theory, 39, 684-693,1993.
23. J. H. Hartman and J. K. Ousterhout, “The Zebra Striped Network File System,” ACM Transactions on Computer Systems, 13(3), 274–310, 1995.
24. J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells and B. Zhao, “OceanStore: An Architecture for Global-Scale Persistent Storage”, Proc. of the Ninth international Conference on Architectural Support for Programming Languages and Operating Systems, Nov. 2000.
25. E. Lee and C. Thekkath, “Petal: Distributed Virtual Disks”, Proc. ACM ASPLOS, 84-92, Oct. 1996.
26. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes, Amsterdam: North-Holland, 1977.
27. R. J. McEliece, D. Sarwate, “On sharing secrets and Reed-Solomon codes”, Comm. ACM, 24(9), 583-584, 1981.
28. J. Ousterhout, A. Cherenson, F. Douglis, M. Nelson and B. Welch, “The Sprite Network Operating System”, IEEE Computer, 21(2): 23-26, Feb. 1988.
29. Chong-Won Park and Jin-Won Park, “A multiple disk failure recovery scheme in RAID systems,” Journal of Systems Architecture, vol. 50, pp. 169–175, 2004.
30. J. S. Plank, “A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems,” Software: Practice and Experience, vol. 27, no. 9, pp. 995–1012, Jan. 1999.
31. J. S. Plank and Y. Ding “Note: Correction to the 1997 Tutorial on Reed-Solomon Coding” Software, Practice & Experience, vol. 35, no. 2, pp. 189–194, Feb. 2005.
32. J. S. Plank, R. L. Collins, A. L. Buchsbaum and M. G. Thomason, “Small Parity-Check Erasure Codes - Exploration and Observations,” International Conference on Dependable Systems and Networks (DSN), Yokohama, Japan, Jun. 2005.
33. J. S. Plank, M. and T. Moore, “Logistical Networking Research and the Network Storage Stack,” USENIX FAST 2002, Conference on File and Storage Technologies, work in progress report, January, 2002.
34. M. Rabin, “Efficient Dispersal of Information for Security, Load Balancing and Fault Tolerance”, J. ACM, 32(4), 335-348, Apr. 1989.
35. I. S. Reed and G. Solomon, “Polynomial Codes over Certain Finite Fields”, J. SIAM, 8(10), 300-304, 1960.
36. M. Satyanarayanan, “Scalable, Secure and Highly Available Distributed File Access”, IEEE Computer, 9-21, May 1990.
37. M. Satyanarayanan, J.J. Kistler, P. Kumar, M. E. Okasaki, E. H. Siegel and D. C. Steere, “CODA - A Highly Available File System for a Distributed Workstation Environment,” IEEE Transactions on Computers, 39(4), 447–459, 1990.
38. A. Shamir, “How to Share a Secret”, Comm. ACM, 612-613, Nov. 1979.
39. SUN Microsystems, Inc. NFS: Network File System version 3 Protocol Specification , Feb. 1994.
40. Chih-Shing Tau and Tzone-I Wang, “Efficient parity placement schemes for tolerating triple disk failures in RAID architectures,” in Proceedings of the17 th International Conference on Advanced Information Networking and Applications (AINA’03), Xi’an, China, mar 2003.
41. M. Waldman, A. D. Rubin and L. F. Cranor, “Publius: A robust, tamper-evident, censorship-resistant, web publishing system”, Proc. 9th USENIX Security Symposium, 59-72, Aug. 2000. Online at: http://www.cs.nyu.edu/∼waldman/publius/publius.pdf
42. J. J. Wylie, M. W. Bigrigg, J. D. Strunk. G. R. Ganger, H. Kiliccote and P. K. Khosla, “Survivable Information Storage Systems”, IEEE Computer, 33(8), 61-68, Aug. 2000.
43. L. Xu and J. Bruck, “X-Code: MDS Array Codes with Optimal Encoding,” IEEE Trans. on Information Theory, 45(1), 272-276, Jan., 1999.
44. L. Xu, V. Bohossian, J. Bruck and D. Wagner, “Low Density MDS Codes and Factors of Complete Graphs,” IEEE Trans. on Information Theory, 45(1), 1817-1826, Nov. 1999.