메뉴 건너뛰기




Volumn , Issue , 2009, Pages 360-369

P-code: A new RAID-6 code with optimal properties

Author keywords

[No Author keywords available]

Indexed keywords

ARRAY CODES; ARRAY SIZES; CODING SCHEME; DISK ARRAY; DISK FAILURE; DISTRIBUTED ENVIRONMENTS; FAILURE TOLERANCE; OPTIMAL CONSTRUCTION; OPTIMAL PROPERTIES; PLACEMENT STRATEGY; SIGNIFICANT IMPACTS; STORAGE EFFICIENCY;

EID: 70449709549     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1542275.1542326     Document Type: Conference Paper
Times cited : (99)

References (22)
  • 1
    • 84944041103 scopus 로고
    • A case for redundant arrays of inexpensive disks (RAID)
    • ACM, pp, June
    • D. Patterson, G. Gibson, and R. Katz. A case for redundant arrays of inexpensive disks (RAID). In ACM SIGMOD, ACM, pp. 109-116, June 1988.
    • (1988) ACM SIGMOD , pp. 109-116
    • Patterson, D.1    Gibson, G.2    Katz, R.3
  • 2
    • 85084160707 scopus 로고    scopus 로고
    • Bianca Schroeder and Garth A. Gibson. Disk Failures in the Real World: What Does an MTTF of 1,000,000 Hours Mean to You? In FAST '07, San Jose, CA, February 2007.
    • Bianca Schroeder and Garth A. Gibson. Disk Failures in the Real World: What Does an MTTF of 1,000,000 Hours Mean to You? In FAST '07, San Jose, CA, February 2007.
  • 3
    • 84947200665 scopus 로고    scopus 로고
    • Eduardo Pinheiro, Wolf-Dietrich Weber, and Luiz Andre Barroso. Failure Trends in a Large Disk Drive Population. In FAST '07, San Jose, CA, February 2007.
    • Eduardo Pinheiro, Wolf-Dietrich Weber, and Luiz Andre Barroso. Failure Trends in a Large Disk Drive Population. In FAST '07, San Jose, CA, February 2007.
  • 5
    • 0029254192 scopus 로고
    • EVENODD: An optimal scheme for tolerating double disk failure in RAID architectures
    • M. Blaum, J. Brady, J. Bruck, and J. Menon. EVENODD: An optimal scheme for tolerating double disk failure in RAID architectures. IEEE Transactions on Computers, 44(2):192-202, 1995.
    • (1995) IEEE Transactions on Computers , vol.44 , Issue.2 , pp. 192-202
    • Blaum, M.1    Brady, J.2    Bruck, J.3    Menon, J.4
  • 6
    • 70449727693 scopus 로고    scopus 로고
    • R5X0: An efficient high distance parity-based code with optimal update complexity
    • RJ10322 A0408-005, IBM Research Division
    • J. Hartiline. R5X0: An efficient high distance parity-based code with optimal update complexity. Research Report RJ10322 (A0408-005), IBM Research Division, 2004.
    • (2004) Research Report
    • Hartiline, J.1
  • 8
    • 53349117741 scopus 로고    scopus 로고
    • Performance Metrics For Erasure Codes in Storage Systems
    • RJ10321 A0408-003, IBM Research Division
    • J. L. Hafner et al. Performance Metrics For Erasure Codes in Storage Systems. Research Report RJ10321 (A0408-003), IBM Research Division, 2004.
    • (2004) Research Report
    • Hafner, J.L.1
  • 9
    • 0032648448 scopus 로고    scopus 로고
    • X-Code: MDS array codes with optimal encoding
    • L. Xu, and J. Bruck. X-Code: MDS array codes with optimal encoding. IEEE Transactions on Information Theory, 45(1):272-276, 1999.
    • (1999) IEEE Transactions on Information Theory , vol.45 , Issue.1 , pp. 272-276
    • Xu, L.1    Bruck, J.2
  • 10
    • 27144525311 scopus 로고    scopus 로고
    • Row-Diagonal Parity for Double Disk Failure Correction
    • P. Corbett et al. Row-Diagonal Parity for Double Disk Failure Correction. In proceedings of FAST'04, 2004.
    • (2004) proceedings of FAST'04
    • Corbett, P.1
  • 14
    • 0020778963 scopus 로고
    • Minimum-check-density codes for correcting bytes of errors, erasures, or defects
    • G. Zaitsev, V. Zinov'ev, and N. Semakov. Minimum-check-density codes for correcting bytes of errors, erasures, or defects. Problems of Information Transmission, vol. 19, pp. 197-204, 1981.
    • (1981) Problems of Information Transmission , vol.19 , pp. 197-204
    • Zaitsev, G.1    Zinov'ev, V.2    Semakov, N.3
  • 17
    • 70449710934 scopus 로고    scopus 로고
    • An algorithm for a two-disk fault-tolerant array with (prime - 1) disks
    • S. Nanda and N. Deo, An algorithm for a two-disk fault-tolerant array with (prime - 1) disks. Congressus Numerantium, vol. 171, pp. 13-23, 2004.
    • (2004) Congressus Numerantium , vol.171 , pp. 13-23
    • Nanda, S.1    Deo, N.2
  • 18
    • 84951914156 scopus 로고    scopus 로고
    • C. Huang and L. Xu. STAR: An efficient coding scheme for correcting triple storage node failures. In proceedings of FAST'05, San Francisco, December 2005.
    • C. Huang and L. Xu. STAR: An efficient coding scheme for correcting triple storage node failures. In proceedings of FAST'05, San Francisco, December 2005.
  • 19
    • 25844490971 scopus 로고    scopus 로고
    • New efficient MDS array codes for RAID Part I: Reed-Solomon-like codes for tolerating three disk failures
    • G. Feng, R. Deng, F. Bao, and J. Shen. New efficient MDS array codes for RAID Part I: Reed-Solomon-like codes for tolerating three disk failures. IEEE Transactions on Computers, 54(9):1071-1080, 2005.
    • (2005) IEEE Transactions on Computers , vol.54 , Issue.9 , pp. 1071-1080
    • Feng, G.1    Deng, R.2    Bao, F.3    Shen, J.4
  • 20
    • 30344465319 scopus 로고    scopus 로고
    • New efficient MDS array codes for RAID Part II: Rabin-like codes for tolerating multiple (≥4) disk failures
    • G. Feng, R. Deng, F. Bao, and J. Shen. New efficient MDS array codes for RAID Part II: Rabin-like codes for tolerating multiple (≥4) disk failures. IEEE Transactions on Computers, 54(12):1473-1483, 2005.
    • (2005) IEEE Transactions on Computers , vol.54 , Issue.12 , pp. 1473-1483
    • Feng, G.1    Deng, R.2    Bao, F.3    Shen, J.4
  • 21
    • 33845569141 scopus 로고    scopus 로고
    • HoVer erasure codes for disk arrays
    • Philadelphia, June
    • J. L. Hafner. HoVer erasure codes for disk arrays. In proceedings of DSN'06, Philadelphia, June 2006.
    • (2006) proceedings of DSN'06
    • Hafner, J.L.1
  • 22
    • 44049101334 scopus 로고    scopus 로고
    • WEAVER Codes: Highly fault tolerant erasure codes for storage systems
    • San Francisco, December
    • J. L. Hafner. WEAVER Codes: Highly fault tolerant erasure codes for storage systems. In proceedings of FAST'05, pp. 211-224, San Francisco, December 2005.
    • (2005) proceedings of FAST'05 , pp. 211-224
    • Hafner, J.L.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.