Parity Declustering for Fault-Tolerant Storage Systems via $t$-designs

Autor:	Dau, Son Hoang, Jia, Yan, Jin, Chao, Xi, Weiya, Chan, Kheong Sann
Rok vydání:	2012
Předmět:	Computer Science - Information Theory
Druh dokumentu:	Working Paper
Popis:	Parity declustering allows faster reconstruction of a disk array when some disk fails. Moreover, it guarantees uniform reconstruction workload on all surviving disks. It has been shown that parity declustering for one-failure tolerant array codes can be obtained via Balanced Incomplete Block Designs. We extend this technique for array codes that can tolerate an arbitrary number of disk failures via $t$-designs. Comment: 13 pages
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1209.6152 Zobrazit plný text záznamu View this record from Arxiv