Flexible usage of redundancy in disk arrays
From MaRDI portal
Publication:1818093
Recommendations
- EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures
- Evaluating approximately balanced parity-declustered data layouts for disk arrays
- Methods for placing data and parity to tolerate two disk failures in disk arrays using complete bipartite graphs
- Design and performance analysis of a disk array system
- Optimizing large data transfers in parity-declustered data layouts
Cited in
(14)- Evaluating approximately balanced parity-declustered data layouts for disk arrays
- Percolation in dense storage arrays
- Efficient data mappings for parity-declustered data layouts
- Optimizing large data transfers in parity-declustered data layouts
- Coding techniques for handling failures in large disk arrays
- String layouts for a redundant array of inexpensive disks
- Efficient mappings for parity-declustered data layouts
- Methods for placing data and parity to tolerate two disk failures in disk arrays using complete bipartite graphs
- Information recover algorithm for double disk failure in raid systems
- EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures
- Design and performance analysis of a disk array system
- Parity information placement in the disk array model
- scientific article; zbMATH DE number 2247721 (Why is no real title available?)
- A construction method for optimally universal hash families and its consequences for the existence of RBIBDs
This page was built for publication: Flexible usage of redundancy in disk arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1818093)