Computer architecture: a quantitative approach
Computer architecture: a quantitative approach
Performance analysis of disk arrays under failure
Proceedings of the sixteenth international conference on Very large databases
Parity declustering for continuous operation in redundant disk arrays
ASPLOS V Proceedings of the fifth international conference on Architectural support for programming languages and operating systems
RAID: high-performance, reliable secondary storage
ACM Computing Surveys (CSUR)
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Uniform Parity Group Distribution in Disk Arrays with Multiple Failures
IEEE Transactions on Computers
Analytic Modeling and Comparisons of Striping Strategies for Replicated Disk Arrays
IEEE Transactions on Computers
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
An analytic behavior model for disk drives with readahead caches and request reordering
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
False sharing problems in cluster-based disk arrays
Proceedings of the 1999 ACM symposium on Applied computing
Minerva: An automated resource provisioning tool for large-scale storage systems
ACM Transactions on Computer Systems (TOCS)
A Gracefully Degradable Declustered RAID Architecture
Cluster Computing
Performance Analysis of Storage Systems
Performance Evaluation: Origins and Directions
Issues and Challenges in the Performance Analysis of Real Disk Arrays
IEEE Transactions on Parallel and Distributed Systems
Reconstruct versus read-modify writes in RAID
Information Processing Letters
Multi-level RAID for very large disk arrays
ACM SIGMETRICS Performance Evaluation Review - Design, implementation, and performance of storage systems
Queueing models of RAID systems with maxima of waiting times
Performance Evaluation
Modeling the relative fitness of storage
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Performance of Two-Disk Failure-Tolerant Disk Arrays
IEEE Transactions on Computers
Why does file system prefetching work?
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
Higher reliability redundant disk arrays: Organization, operation, and coding
ACM Transactions on Storage (TOS)
Reconstruct versus read-modify writes in RAID
Information Processing Letters
A component-based analytical performance model of IP-based SAN
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
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
BASIL: automated IO load balancing across storage devices
FAST'10 Proceedings of the 8th USENIX conference on File and storage technologies
Why specialized disks for composite operations may be unnecessary
ACM SIGARCH Computer Architecture News
A Hybrid Approach to Failed Disk Recovery Using RAID-6 Codes: Algorithms and Performance Evaluation
ACM Transactions on Storage (TOS)
Pesto: online storage performance management in virtualized datacenters
Proceedings of the 2nd ACM Symposium on Cloud Computing
Rebuild processing in RAID5 with emphasis on the supplementary parity augmentation method[37]
ACM SIGARCH Computer Architecture News
Model building for dynamic multi-tenant provider environments
ACM SIGOPS Operating Systems Review
| Hi-index | 14.98 |
A Redundant Array of Independent Disks (RAID) of G disks provides protection against single disk failures by adding one parity block for each G驴 1 data blocks. In a clustered RAID, the G data/parity blocks are distributed over a cluster of C disks (C G), thus reducing the additional load on each disk due to a single disk failure. However, most methods proposed for implementing such a mapping do not work for general C and G values.In this paper, we describe a fast mapping algorithm based on almost-random permutations. An analytical model is constructed, based on the queue with a permanent customer, to predict recovery time and read/write performance. The accuracy of the results derived from this model is validated by comparing with simulations. Our analysis shows that clustered RAID is significantly more tolerant of disk failure than the basic RAID scheme. Both recovery time and performance degradation during recovery are substantially reduced in clustered RAID; moreover, these gains can be achieved using fairly small C/G ratios.