DocumentCode :
2693418
Title :
A gracefully degradable declustered RAID architecture with near optimal maximal read and write parallelism
Author :
Chau, Siu-Cheung ; Fu, Ada Wai-Chee
Author_Institution :
Dept. of Phys. & Comput., Wilfrid Laurier Univ., Waterloo, Ont., Canada
fYear :
2000
fDate :
2000
Firstpage :
309
Lastpage :
318
Abstract :
A new layout method, Prime-groups, is proposed to evenly distribute parity groups for declustered RAID. Prime-groups satisfies most of the layout goals for a good declustered RAID layout. For the goals that are not satisfied, it is near optimal. A new layout goal maximal write and reconstruction parallelism is also proposed. If a layout satisfies the new goal, all the surviving disks can be read in parallel and can be rewritten in parallel during reconstruction and reconfiguration. Prime-groups satisfies the new goal when the write request begins in the first disk of the array. It is also near optimal in term of declustering ratio when p is a prime. Prime-groups can compliment the layouts proposed by G.A. Alvarez et. al. (1996), as the criteria to obtain a good layout is quite different between Prime-groups and those proposed by Alvarez et. al
Keywords :
RAID; fault tolerant computing; parallel architectures; parallel programming; Prime-groups; declustered RAID; declustered RAID layout; declustering ratio; gracefully degradable declustered RAID architecture; layout goal maximal write; layout goals; layout method; near optimal maximal read/write parallelism; parity groups; reconstruction parallelism; write request; Computer architecture; Concurrent computing; Degradation; Delay; Distributed computing; Image reconstruction; Image storage; Microcomputers; Parallel processing; Physics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Cluster Computing, 2000. Proceedings. IEEE International Conference on
Conference_Location :
Chemnitz
Print_ISBN :
0-7695-0896-0
Type :
conf
DOI :
10.1109/CLUSTR.2000.889084
Filename :
889084
Link To Document :
بازگشت