Patterson D A,Gibson G A,Katz R H.A case for redundant arrays of inexpensive disks(RAID)[A].ACM International Conference on Management of Data[C].Chicago:ACM Press,1988.109-116.
[2]
M Blaum,J Brady,J Brock,J Menon.EVENODD:an efficient scheme for tolerating double disk failures in RAID architectures[J].IEEE Trans Computers,1995,44(2):192-202.
[3]
C Park.Efficient placement of parity and data to tolerate two disk failures in disk array systems[J].IEEE Tram Parallel Distrib Syst[J].t995,6(11):1177-1184.
[4]
L Xu,V Bohossian,J Bruck,D G Wagner.Low-density MDS codes and factors of complete graphs[J].IEEE Transactions on Information Theory,1999,45(6):1817-1826.
[5]
Nam-Kyu Lee,Sung-Bong Yang,Kyoung-Woo Lee.Efficient parity placement schemes for tolerating up to two disk failures in disk arrays[J].Journal of Systems Architecture,2000,46(15):1383-1402.
[6]
Zhou Jie,Wang Gang,Liu Xiao-guang,Liu Jing.The study of graph decompositions and placement of parity and data to tolerate two failures in disk arrays:conditions and existence[J].Chinese Journal of Computers,2003,26(10):1379-1386.
[7]
Lisa Hellerstein,Garth A Gibson,Richard M Karp,Randy H Katz,David A Patterson.Coding techniques for handling failures in large disk arrays[J].Algorithmica,1994,12(2/3):182-208.
W D Wallis.Onc-Factorizations[M].Boston:Kiuwer Academic Publishers,1997.
[10]
Darryn Bryant,Barbara M Maenhaut,Ian M Wanless.A family of perfect factorisatioos of complete bipartite graphs[J].Journal of Combinatorial Theory,Series A,2002,98(2):328-342.
