Permutation Development Data Layout (PDDL) Disk Array Declustering
作者： Walter A. Burkhard , Jesse Steinberg , Thomas J.E. Schwarz
DOI:
关键词:
摘要: Declustered data organizations have been proposed to achieve less-intrusive reconstruction of a failed disk’s contents. In previous work, Holland and Gibson identified six desirable properties for ideal layouts. Ideal layouts exist very limited family configurations. The PRIME layout deviates from the stated only slightly its run-time performance is good light workloads. DATUM does not meet one but has heavy We present Permutation Development Data Layout (PDDL) which excellent both Moreover, PDDL straightforward space efficient implementations. Our simulation studies show that new provide parallel access reduced incremental loads during degraded operation. can easily accommodate multiple failure tolerant redundancy schemes.
scu.edu参考文章(17)
Peter M. Chen, Garth A. Gibson, Randy H. Katz, Edward K. F. Lee, Patterson: "raid: high-performance, reliable secondary storage ACM Computing Surveys. ,(1994)
Richard R. Muntz, John C. S. Lui, Performance Analysis of Disk Arrays under Failure very large data bases. pp. 162- 173 ,(1990)
Yin Jianxing, Steven Furino, Miao Ying, Frames and Resolvable Designs: Uses, Constructions and Existence ,(1996)
W.V. Courtright, G. Gibson, M. Holland, J. Zelenka, A structured approach to redundant disk array implementation Proceedings of IEEE International Computer Performance and Dependability Symposium. pp. 11- 20 ,(1996) , 10.1109/IPDS.1996.540194
Walter A. Burkhard, Flaviu Cristian, Guillermo A. Alvarez, Larry J. Stockmeyer, Declustered disk array architectures with optimal and near-optimal parallelism international symposium on computer architecture. ,vol. 26, pp. 109- 120 ,(1998) , 10.1145/279358.279374
R. C. BOSE, ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS Annals of Human Genetics. ,vol. 9, pp. 353- 399 ,(1939) , 10.1111/J.1469-1809.1939.TB02219.X
A. Merchant, P.S. Yu, Analytic modeling of clustered RAID with mapping based on nearly random permutation IEEE Transactions on Computers. ,vol. 45, pp. 367- 373 ,(1996) , 10.1109/12.485575
Eric J. Schwabe, Ian M. Sutherland, Improved parity-declustered layouts for disk arrays Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures - SPAA '94. ,vol. 53, pp. 76- 84 ,(1994) , 10.1145/181014.181045
J. Menon, D. Mattson, Distributed sparing in disk arrays Digest of Papers COMPCON Spring 1992. pp. 410- 421 ,(1992) , 10.1109/CMPCON.1992.186748
A.L.N. Reddy, P. Banerjee, Gracefully degradable disk arrays [1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium. pp. 401- 408 ,(1991) , 10.1109/FTCS.1991.146692