On data reliability algorithms in storage systems

zbMATH Open1150.68359MaRDI QIDQ3501573FDOQ3501573

Authors Baoyu Na, Yusen Zhang, Peng Liu, Hailin Shao

Publication date 3 June 2008

zbMATH Keywords

maximum distance separablelow-density parity codesparity array codesredundant array of independent disk

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data encryption (aspects in computer science) (68P25)

Recommendations

• Zigzag decodable codes: linear-time erasure codes with applications to data storage
• Sparse random erasure code: a fault tolerance scheme for large-scale storage system
• Space bounds for reliable storage: fundamental limits of coding
• Network Coding for Distributed Storage Systems
• Reliability analysis model of cluster storage system by object grouping

Cited in

(5)

• Sparse random erasure code: a fault tolerance scheme for large-scale storage system
• Zigzag decodable codes: linear-time erasure codes with applications to data storage
• Reliability analysis model of cluster storage system by object grouping
• The reliability design and availability analysis of a distributed storage system
• Reliable computing with unreliable components: Using separable environments to stabilize long-term information storage

Describes a project that uses

Uses Software

• EVENODD

This page was built for publication: On data reliability algorithms in storage systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3501573)