FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
GRID codes: Strip-based erasure codes with high fault tolerance for storage systems
ACM Transactions on Storage (TOS)
A performance evaluation and examination of open-source erasure coding libraries for storage
FAST '09 Proccedings of the 7th conference on File and storage technologies
P-Code: a new RAID-6 code with optimal properties
Proceedings of the 23rd international conference on Supercomputing
An algorithm based mesh check-sum fault tolerant scheme for stream ciphers
International Journal of Communication Networks and Distributed Systems
International Journal of High Performance Computing Applications
A mesh check-sum ABFT scheme for stream ciphers
International Journal of Communication Networks and Distributed Systems
Higher reliability redundant disk arrays: Organization, operation, and coding
ACM Transactions on Storage (TOS)
T-code: 3-erasure longest lowest-density MDS codes
IEEE Journal on Selected Areas in Communications
Optimal recovery of single disk failure in RDP code storage systems
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Understanding latent sector errors and how to protect against them
ACM Transactions on Storage (TOS)
Rotary-code: Efficient MDS array codes for RAID-6 disk arrays
WSEAS Transactions on Computers
Understanding latent sector errors and how to protect against them
FAST'10 Proceedings of the 8th USENIX conference on File and storage technologies
ACM Transactions on Storage (TOS)
Erasure coding in windows azure storage
USENIX ATC'12 Proceedings of the 2012 USENIX conference on Annual Technical Conference
Sector-Disk (SD) Erasure Codes for Mixed Failure Modes in RAID Systems
ACM Transactions on Storage (TOS)
SD codes: erasure codes designed for how storage systems really fail
FAST'13 Proceedings of the 11th USENIX conference on File and Storage Technologies
FAST'14 Proceedings of the 12th USENIX conference on File and Storage Technologies
| Hi-index | 0.00 |
We present a new family of XOR-based erasure codes primarily targeted for use in disk arrays. These codes have a unique data/parity layout, with both horizontal and vertical parity arrangements giving rise to the name HoVer codes. We give constructions that tolerate up to four disk failures. Though the codes are only approximately maximum distance separable (MDS), they have performance advantages over other codes at many common array sizes. In addition, they have fewer parameter constraints than many other codes which enables greater choices and flexibility in efficiency and performance trade-offs.