Parity assignment technique for parity declustering in a parity array of a storage system

作者: Peter F. Corbett

DOI:

关键词: Disjoint setsParallel computingTopologyParity (mathematics)MathematicsParity assignmentComputer data storage

摘要: A parity assignment technique enables declustering in a large, balanced (“super-stripe”) array of storage system. The may be constructed by combining plurality unbalanced stripe arrays, each having blocks on set devices, such as disks, that are disjoint from the disks storing data blocks. distributes to groups among combined super-stripe all contain same amount or information. Moreover, ensures surviving loaded uniformly during reconstruction phase after single double disk failure.

参考文章(112)
Azer Bestavros, D. B. Chen, Wing Shing Wong, Reliability and Performance of Parallel Disks Bell Labs Technical Journal. ,(1989)
Jonathan S Goldick, Kathy Benninger, Christopher Kirby, Christopher Maher, Bill Zumach, Pittsburgh Supercomputing Center, Multi-resident AFS: an adventure in mass storage usenix annual technical conference. pp. 5- 5 ,(1995)
Gregory Bolstad, Jay Randall, James Schweitzer, John Staub, Thomas Ulrich, Wilbur Priester, Dynamically distributed file system ,(2002)
CharlesMilligan, JamesHughes, High Performance RAIT 高能物理与核物理计算国际会议公报:英文版. pp. 237- 240 ,(2001)
Michael Bermingham, Christopher S. Maclellan, John K. Walton, Systems and methods which utilize parity sets ,(2001)
Donald L. Schilling, SM codec method and apparatus ,(1987)