Repository logo
Log In(current)
  1. Home
  2. Colleges & Schools
  3. Graduate School
  4. Masters Theses
  5. Minimal-density, RAID-6 Codes: An Approach for w = 9
Details

Minimal-density, RAID-6 Codes: An Approach for w = 9

Date Issued
May 1, 2014
Author(s)
Burke, Bryan Andrew  
Advisor(s)
James S. Plank
Additional Advisor(s)
Jian Huang
Bradley T. Vander Zanden
Permanent URI
https://trace.tennessee.edu/handle/20.500.14382/38697
Abstract

RAID-6 erasure codes provide vital data integrity in modern storage systems. There is a class of RAID-6 codes called “Minimal Density Codes,” which have desirable performance properties. These codes are parameterized by a “word size,” w, and constructions of these codes are known when w and w + 1 are prime numbers. However, there are obvious gaps for which there is no theory. An exhaustive search was used to fill in the important gap when w = 8, which is highly applicable to real-world systems, since it is a power of 2. This paper extends that approach to address the next theoretical hole at w = 9 by expanding upon the techniques used for w = 8 and adding customizations to allow for parallel processing.

Subjects

raid-6

erasure code

mds

Disciplines
Theory and Algorithms
Degree
Master of Science
Major
Computer Science
Embargo Date
January 1, 2011
File(s)
Thumbnail Image
Name

BBurkeFinal.pdf

Size

278.28 KB

Format

Adobe PDF

Checksum (MD5)

e816add68e3638b2da0b4e5b2dcdac8d

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Privacy policy
  • End User Agreement
  • Send Feedback
  • Contact
  • Libraries at University of Tennessee, Knoxville
Repository logo COAR Notify