Title :
RAID5x-Based Storage Complexity Analysis
Author :
Hu, Ming ; Jiang, Minghua
Author_Institution :
Coll. of Comput. Sci., Wuhan Univ. of Sci. & Eng., Wuhan
Abstract :
This paper analyzes the complexity of double disk fault tolerant storage scheme RAID5x under three types of states: normal, fault, and reconstruction. As a result, the space overhead of RAID5x is less than other code-mixing solution and is higher than XOR-based code solutions. Although RAID5x´s mapping produces the computation overhead of the controller, it optimizes the data-accessing performance of the entire storage system. Its parity computing overhead of data-accessing is low like RAID5 at the normal state and almost keeps constant increase from the normal to the fault or between two reconstruction states.
Keywords :
RAID; fault tolerant computing; RAID5x-based storage complexity analysis; code-mixing solution; double disk fault tolerant storage; parity computing; Computer science; Control systems; Educational institutions; Fault tolerance; High performance computing; Information processing; Performance analysis; Physics computing; Protection; Redundancy;
Conference_Titel :
High Performance Computing and Communications, 2008. HPCC '08. 10th IEEE International Conference on
Conference_Location :
Dalian
Print_ISBN :
978-0-7695-3352-0
DOI :
10.1109/HPCC.2008.18