Performance analysis of disk arrays under failure
Proceedings of the sixteenth international conference on Very large databases
The architecture of a fault-tolerant cached RAID controller
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
RAID: high-performance, reliable secondary storage
ACM Computing Surveys (CSUR)
Architectures and algorithms for on-line failure recovery in redundant disk arrays
Distributed and Parallel Databases - Special issue on disk arrays
ACM Transactions on Computer Systems (TOCS)
On Variable Scope of Parity Protection in Disk Arrays
IEEE Transactions on Computers
Uniform Parity Group Distribution in Disk Arrays with Multiple Failures
IEEE Transactions on Computers
Analytic Modeling of Clustered RAID with Mapping Based on Nearly Random Permutation
IEEE Transactions on Computers
RAID5 Performance with Distributed Sparing
IEEE Transactions on Parallel and Distributed Systems
A performance comparison of RAID-5 and log-structured arrays
HPDC '95 Proceedings of the 4th IEEE International Symposium on High Performance Distributed Computing
The performance impact of I/O optimizations and disk improvements
IBM Journal of Research and Development
Towards higher disk head utilization: extracting free bandwidth from busy disk drives
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Multi-level RAID for very large disk arrays
ACM SIGMETRICS Performance Evaluation Review - Design, implementation, and performance of storage systems
Performance of Two-Disk Failure-Tolerant Disk Arrays
IEEE Transactions on Computers
Higher reliability redundant disk arrays: Organization, operation, and coding
ACM Transactions on Storage (TOS)
| Hi-index | 0.89 |
RAID5 (Redundant Arrays of Independent Disk level 5) is a popular paradigm, which uses parity to protect against single disk failures. A major shortcoming of RAID5 is the small write penalty, i.e., the cost of updating parity when a data block is modified. Read-modify writes and reconstruct writes are alternative methods for updating small data and parity blocks. We use a queuing formulation to determine conditions under which one method outperforms the other. Our analysis shows that in the case of RAID6 and more generally disk arrays with k check disks tolerating k disk failures, RCW outperforms RMW for higher values of N and G. We note that clustered RAID and variable scope of parity protection methods favor reconstruct writes. A dynamic scheme to determine the more desirable policy based on the availability of appropriate cached blocks is proposed.