An approach to RAID-6 based on cyclic groups
Jackson, Robert, Rumynin, Dmitriy and Zaboronski, Oleg V.. (2011) An approach to RAID-6 based on cyclic groups. Applied Mathematics & Information Sciences, Vol.5 (No.2). pp. 148-170. ISSN 1935-0090Full text not available from this repository.
Official URL: http://naturalspublishing.com/index.asp
As the size of data storing arrays of disks grows, it becomes vital to protect data against double disk failures. A popular method of protection is via the Reed-Solomon (RS) code with two parity check symbols. In the present paper we construct alternative examples of linear block codes protecting against two erasures. Our construction is based on an abstract notion of cone. Concrete cones are constructed via matrix representations of cyclic groups of prime order. In particular, this construction produces EVENODD code. Interesting conditions on the prime number arise in our analysis of these codes. At the end, we analyse an assembly implementation of the corresponding system on a general purpose processor and compare its write and recovery speed with the standard DP-RAID system.
|Item Type:||Journal Article|
|Subjects:||Q Science > QA Mathematics|
|Divisions:||Faculty of Science > Mathematics|
|Journal or Publication Title:||Applied Mathematics & Information Sciences|
|Official Date:||May 2011|
|Page Range:||pp. 148-170|
|Access rights to Published version:||Restricted or Subscription Access|
Actions (login required)