DocumentCode
2540820
Title
Permutation development data layout (PDDL)
Author
Schwarz, Thomas J E ; Steinberg, Jesse ; Burkhard, Walter A.
Author_Institution
Jesuit Sch. of Theology, Berkeley, CA, USA
fYear
1999
fDate
9-13 Jan 1999
Firstpage
214
Lastpage
217
Abstract
Declustered data organizations in disk arrays (RAIDs) achieve less-intrusive reconstruction of data after a disk failure. We present PDDL, a new data layout for declustered disk arrays. PDDL layouts exist for a large variety of disk array configurations with a distributed spare disk. PDDL declustered disk arrays have excellent run-time performance under light and heavy workloads. PDDL maximizes access parallelism in the most critical circumstances, namely during reconstruction of data on the spare disk. PDDL occurs minimum address translation overhead compared to all other proposed declustering layouts
Keywords
RAID; magnetic disc storage; PDDL; access parallelism; data layout; declustered data organizations; disk arrays; permutation development data layout; run-time performance; Availability; Computer science; Costs; Electronic switching systems; Laboratories; Optical arrays; Parallel processing; Reactive power; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
High-Performance Computer Architecture, 1999. Proceedings. Fifth International Symposium On
Conference_Location
Orlando, FL
Print_ISBN
0-7695-0004-8
Type
conf
DOI
10.1109/HPCA.1999.744365
Filename
744365
Link To Document