Abstract | ||
---|---|---|
To satisfy the explosive growth of data in large-scale data centers, where redundant arrays of independent disks (RAIDs), especially RAID-5, are widely deployed, effective storage scaling and disk expansion methods are desired. However, a way to reduce the data migration overhead and maintain the reliability of the original RAID are major concerns of storage scaling. To address these problems, we propose a new RAID scaling scheme, H-Scale, to achieve fast RAID scaling via hybrid stripe layouts. H-Scale takes advantage of the loose restriction of stripe structures to choose migrated data and to create hybrid stripe structures. The main advantages of our scheme include: (1) dramatically reducing the data migration overhead and thus speeding up the scaling process, (2) maintaining the original RAID’s reliability, (3) balancing the workload among disks after scaling, and (4) providing a general scaling approach for different RAID levels. Our theoretical analysis show that H-Scale outperforms existing scaling solutions in terms of data migration, I/O overheads, and parity update operations. Evaluation results on a prototype implementation demonstrate that H-Scale speeds up the online scaling process by up to 60% under SPC traces, and similar improvements on scaling time and user response time are also achieved by evaluations using standard benchmarks.
|
Year | DOI | Venue |
---|---|---|
2016 | 10.1145/2822895 | TOS |
Keywords | Field | DocType |
RAID, RAID scaling, hybrid stripe | Disk array,Computer science,Parallel computing,Response time,Real-time computing,Standard RAID levels,RAID,Nested RAID levels,Scaling,Parity drive,Data migration | Journal |
Volume | Issue | ISSN |
12 | 3 | 1553-3077 |
Citations | PageRank | References |
0 | 0.34 | 22 |
Authors | ||
6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jiguang Wan | 1 | 47 | 10.21 |
Peng Xu | 2 | 28 | 2.69 |
Xubin He | 3 | 747 | 63.49 |
Jibin Wang | 4 | 15 | 2.45 |
Junyao Li | 5 | 0 | 0.34 |
Changsheng Xie | 6 | 19 | 2.35 |