Taking advantage of heterogeneity in disk arrays
Saved in:
| Title: | Taking advantage of heterogeneity in disk arrays |
|---|---|
| Authors: | Cortes, T. toni@ac.upc.es, Labarta, J.1 jesus@ac.upc.es |
| Source: | Journal of Parallel & Distributed Computing. Apr2003, Vol. 63 Issue 4, p448. 17p. |
| Subjects: | Disk access (Computer science), Microcomputer workstations (Computers) |
| Abstract: | Disk arrays, or RAIDs, have become the solution to increase the capacity and bandwidth of most storage system, but their usage has some limitations because all the disks in the array have to be equal. Nowadays, assuming a homogeneous set of disks to build an array is becoming a not very realistic assumption in many environments, especially in low-cost clusters of workstations. It is difficult to find a disk with the same characteristics as the ones in the array and replacing or adding new disks breaks the homogeneity. In this paper, we propose two block-distribution algorithms (one for RAID0 and an extension for RAID5) that can be used to build disk arrays from a heterogeneous set of disks. We also show that arrays using this algorithm are able to serve many more disk requests per second than when blocks are distributed assuming that all disks have the lowest common speed, which is the solution currently being used. [Copyright &y& Elsevier] |
| Copyright of Journal of Parallel & Distributed Computing is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 10007235 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Taking advantage of heterogeneity in disk arrays – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Cortes%2C+T%2E%22">Cortes, T.</searchLink><i> toni@ac.upc.es</i><br /><searchLink fieldCode="AR" term="%22Labarta%2C+J%2E%22">Labarta, J.</searchLink><relatesTo>1</relatesTo><i> jesus@ac.upc.es</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Journal+of+Parallel+%26+Distributed+Computing%22">Journal of Parallel & Distributed Computing</searchLink>. Apr2003, Vol. 63 Issue 4, p448. 17p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Disk+access+%28Computer+science%29%22">Disk access (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Microcomputer+workstations+%28Computers%29%22">Microcomputer workstations (Computers)</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Disk arrays, or RAIDs, have become the solution to increase the capacity and bandwidth of most storage system, but their usage has some limitations because all the disks in the array have to be equal. Nowadays, assuming a homogeneous set of disks to build an array is becoming a not very realistic assumption in many environments, especially in low-cost clusters of workstations. It is difficult to find a disk with the same characteristics as the ones in the array and replacing or adding new disks breaks the homogeneity. In this paper, we propose two block-distribution algorithms (one for RAID0 and an extension for RAID5) that can be used to build disk arrays from a heterogeneous set of disks. We also show that arrays using this algorithm are able to serve many more disk requests per second than when blocks are distributed assuming that all disks have the lowest common speed, which is the solution currently being used. [Copyright &y& Elsevier] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Journal of Parallel & Distributed Computing is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=10007235 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1016/S0743-7315(03)00038-8 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 17 StartPage: 448 Subjects: – SubjectFull: Disk access (Computer science) Type: general – SubjectFull: Microcomputer workstations (Computers) Type: general Titles: – TitleFull: Taking advantage of heterogeneity in disk arrays Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Cortes, T. – PersonEntity: Name: NameFull: Labarta, J. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 04 Text: Apr2003 Type: published Y: 2003 Identifiers: – Type: issn-print Value: 07437315 Numbering: – Type: volume Value: 63 – Type: issue Value: 4 Titles: – TitleFull: Journal of Parallel & Distributed Computing Type: main |
| ResultId | 1 |
