Increased reliability with SSPiRAL data layouts

2008 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, MASCOTS

Volumn , Issue , 2008, Pages

  Amer, Ahmed ^a   Long, Darrell D E ^b   Schwarz, Thomas ^c   Paris, Jehan François ^d  

^a UNIVERSITY OF PITTSBURGH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c SANTA CLARA UNIVERSITY   (United States)

^d UNIVERSITY OF HOUSTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARRAY LAYOUT; DATA LAYOUTS; DATA LOSS; EXCLUSIVE-OR; STORAGE COSTS; STORAGE SYSTEMS;

COMPUTER NETWORKS; DISKS (MACHINE COMPONENTS); DYNAMIC ANALYSIS;

DISKS (STRUCTURAL COMPONENTS);

EID: 65949092562     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MASCOT.2008.4770553     Document Type: Conference Paper

References (23)

1. G. A. Alvarez, W. A. Burkhard, and F. Cristian. Tolerating multiple failures in RAID architectures with optimal storage and uniform declustering. In Proceedings of the 24th International Symposium on Computer Architecture (ISCA), pages 62-72, Denver, CO, USA, 1997. ACM.
2. A. Amer, J.-F. Paris, T. Schwarz, V. Ciotola, and J. LarkbyLahet. Outshining Mirrors: MTTDL of Fixed-Order SSPiRAL Layouts. In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI07), San Diego, CA, USA, Sept. 2007.
3. M. Blaum, J. Brady, J. Bruck, and J. Menon. Evenodd: An efficient scheme for tolerating double disk failures in RAID architectures. IEEE Transactions on Computers, 44(2): 192-202, 1995.
4. P. Corbett, B. English, A. Goel, T. Grcanac, S. Kleiman, J. Leong, and S. Sankar. Row-diagonal parity for double disk failure correction. In Proceedings of the USENIX Conference on File and Storage Technologies (FAST), pages 114, San Francisco, CA, USA, 2004. USENIX Association.
5. G. A. Gibson. Redundant Disk Arrays: Reliable, Parallel Secondary Storage. PhD thesis, University of California at Berkeley, 1990.
6. H. Gropp. The CRC Handbook of Combinatorial Designs, chapter IV. 6 Configuration. CRC Press, 1996.
7. J. L. Hafner. Weaver codes: Highly fault tolerant erasure codes for storage systems. In Proceedings of the USENIX Conference on File and Storage Technologies (FAST), San Francisco, CA, USA, Dec. 2005.
8. J. L. Hafner and K. Rao. Notes on reliability models for non-MDS erasure codes. Technical Report RJ10391 (A0610-035), IBM Research Division, Almadén Research Center, 650 Harry Road, San Jose, CA 95120-96099, Oct. 2006.
9. L. Hellerstein, G. Gibson, R. Karp, R. Katz, and D. Patterson. Coding techniques for handling failures in large disk arrays. Algorithmica, 12(2-3):182-208, 1992.
10. K. Hwang, H. Jin, and R. Ho. RAID-x: A new distributed disk array for I/O-centric cluster computing. In Proceedings of the 9th IEEE Internation High Performance Distributed Computing Symposium (HPDC), pages 279-286, 2000.
11. Z. Jie, W. Gang, L. Xiaogugang, and L. Jing. The study of graph decompositions and placement of parity and data to tolerate two failures in disk arrays: Conditions and existence. Chinese Journal of Computers, 26(10):1379-1386, Oct. 2003.
12. W. Litwin, R. Moussa, and T. Schwarz. LH*RS - a highlyavailable scalable distributed data structure. Transactions on Database Systems (TODS), 30(3), Sept. 2005.
13. D. D. E. Long, B. R. Montague, and L.-F. Cabrera. Swift/RAID: A distributed RAID system. Computing Systems, 7(3):333-359, 1994.
14. M. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman. Efficient erasure correcting codes. IEEE Transactions on Information Theory, 47(2):569-584, 2001.
15. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. A. Spielman, and V. Stemann. Practical loss-resilient codes. In Proceedings of the 29th ACM Symposium on Theory of Computing (STOC), pages 150-159, New York, NY, USA, 1997. ACM Press.
16. P. Lyman and H. R. Varian. How much storage is enough? ACMQueue, 4(4), June 2003.
17. P. Lyman and H. R. Varian. How much information?, Mar. 2007. http://www.sims.berkeley.edu/how-much-info-2003.
18. J.-F. Pâris, T. J. E Schwarz, and D. D. E. Long. Selfadaptive disk arrays. In Proceedings of the 8th International Symposium on Stabilization, Safety, and Security of Distributed Systems, pages 469-483, Dallas, TX, USA, Nov. 2006.
19. D. A. Patterson, G. Gibson, and R. H. Katz. A case for redundant arrays of inexpensive disks (RAID). In Proceedings of SIGMOD, pages 109-116. ACM, 1988.
20. J. S. Plank and M. G. Thomason. A practical analysis of low-density parity-check erasure codes for wide-area storage applications. In Proceedings of the 38th Annual IEEEaFIP International Conference on Dependable Systems and Networks (DSN), Florence, Italy, June 2004.
21. A. Shokrollahi. Raptor codes. IEEE/ACM Transactions on Networking, 14(SI):2551-2567, 2006.
22. B. T. Theodorides and W. A. Burkhard. Ê: Disk array data layout tolerating multiple failures. In Proceedings of the IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS), pages 21-32, Monterey, CA, USA, 2006.
23. A. Wilner. Multiple drive failure tolerant RAID system. US Patent US 6,327,672 Bl, LSI Logic Corporation, Milpitas, CA, Dec. 2001.