A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
The HP AutoRAID hierarchical storage system
ACM Transactions on Computer Systems (TOCS) - Special issue on operating system principles
Comparing random data allocation and data striping in multimedia servers
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Efficient, distributed data placement strategies for storage area networks (extended abstract)
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
A Fast Algorithm for Online Placement and Reorganization of Replicated Data
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Computer Architecture: A Quantitative Approach
Computer Architecture: A Quantitative Approach
Volume Management in SAN Environment
ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems
SCADDAR: An Efficient Randomized Technique to Reorganize Continuous Media Blocks
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
A Simple Way to Estimate the Cost of Downtime
LISA '02 Proceedings of the 16th USENIX conference on System administration
Efficient disk replacement and data migration algorithms for large disk subsystems
ACM Transactions on Storage (TOS)
Awarded Best Student Paper! -- Improving Storage System Availability with D-GRAID
FAST '04 Proceedings of the 3rd USENIX Conference on File and Storage Technologies
Increasing the capacity of RAID5 by online gradual assimilation
SNAPI '04 Proceedings of the international workshop on Storage network architecture and parallel I/Os
CRUSH: controlled, scalable, decentralized placement of replicated data
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
SLAS: An efficient approach to scaling round-robin striped volumes
ACM Transactions on Storage (TOS)
WorkOut: I/O workload outsourcing for boosting RAID reconstruction performance
FAST '09 Proccedings of the 7th conference on File and storage technologies
WeLe-RAID: a SSD-based RAID for system endurance and performance
NPC'11 Proceedings of the 8th IFIP international conference on Network and parallel computing
Design and Evaluation of a New Approach to RAID-0 Scaling
ACM Transactions on Storage (TOS)
CRAID: online RAID upgrades using dynamic hot data reorganization
FAST'14 Proceedings of the 12th USENIX conference on File and Storage Technologies
| Hi-index | 0.00 |
Previous approaches to RAID scaling either require a very large amount of data to be migrated, or cannot tolerate multiple disk additions without resulting in disk imbalance. In this paper, we propose a new approach to RAID-0 scaling called FastScale. First, FastScale minimizes data migration, while maintaining a uniform data distribution. With a new and elastic addressing function, it moves only enough data blocks from old disks to fill an appropriate fraction of new disks without migrating data among old disks. Second, FastScale optimizes data migration with two techniques: (1) it accesses multiple physically successive blocks via a single I/O, and (2) it records data migration lazily to minimize the number of metadata writes without compromising data consistency. Using several real system disk traces, our experiments show that compared with SLAS, one of the most efficient traditional approaches, FastScale can reduce redistribution time by up to 86.06% with smaller maximum response time of user I/Os. The experiments also illustrate that the performance of the RAID-0 scaled using FastScale is almost identical with that of the round-robin RAID-0.