DocumentCode
2509725
Title
A Data Layout Method in Heterogeneous RAID
Author
Liu, Yan ; Xie, Xiaodong ; Li, Huaiyang
Author_Institution
Data Storage Div., Technol. Huazhong Univ. of Sci. & Technol., Wuhan, China
fYear
2009
fDate
25-27 Sept. 2009
Firstpage
218
Lastpage
225
Abstract
The data layout of traditional RAID can´t adapt to the heterogeneous RAID that consists of disks with different capacity and/or performance, because it will cause waste of disk storage space and decrease of the integrated disks´ bandwidth. Based on the concept of ldquostripe patternrdquo, we bring out the concept of ldquopseudo stripe patternrdquo and propose to place data in heterogeneous RAID with repetitions of pseudo stripe pattern. It takes into account of storage space and array I/O bandwidth, while promising acceptable data management overhead. The results of simulations validate that heterogeneous RAID applying our data layout policy exhibits better and steadier performance compared with that applying traditional homogeneous RAID data placement.
Keywords
RAID; data structures; I/O bandwidth; data layout method; data management overhead; disk storage space; heterogeneous RAID; pseudo stripe pattern concept; redundant array of independent disks; Availability; Bandwidth; Capacity planning; Computer science; Contracts; Embedded computing; Interleaved codes; Laboratories; Memory; Space technology; RAID; data layout; heterogeneous disk; storage;
fLanguage
English
Publisher
ieee
Conference_Titel
Scalable Computing and Communications; Eighth International Conference on Embedded Computing, 2009. SCALCOM-EMBEDDEDCOM'09. International Conference on
Conference_Location
Dalian
Print_ISBN
978-0-7695-3825-9
Type
conf
DOI
10.1109/EmbeddedCom-ScalCom.2009.47
Filename
5341532
Link To Document