Dynamic parity stripe reorganizations for RAID5 disk arrays

Author

Mogi, Kazuhiko ; Kitsuregawa, Masaru

Author_Institution

Inst. of Ind. Sci., Tokyo Univ., Japan

fYear

1994

fDate

28-30 Sep 1994

Firstpage

17

Lastpage

26

Abstract

RAID5 disk arrays provide high performance and high reliability for reasonable cost. However RAIDS suffers a performance penalty during block updates. We examine the feasibility of using “dynamic parity striping” to improve the performance of block updates. Instead of updating each block independently, this method buffers a number of updates, generates a new stripe composed of the newly updated blocks, then writes the full stripe back to disk. Two implementations are considered in this paper. One is a log-structured file system (LFS) based method and the other is Virtual Striping. Both methods achieve much higher performance than conventional approaches. The performance characteristics of the LFS based method and the Virtual Striping method are clarified

Keywords

file organisation; performance evaluation; scheduling; software reliability; storage management; LFS based method; RAID5 disk arrays; Virtual Striping; access scheduling; block updates; cost; dynamic parity stripe reorganizations; dynamic parity stripping; high performance; high reliability; log-structured file system; Costs; Drives; Encoding; File servers; Heuristic algorithms; Microprocessors; Performance analysis; Throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Information Systems, 1994., Proceedings of the Third International Conference on

Conference_Location

Austin, TX

Print_ISBN

0-8186-6400-2

Type

conf

DOI

10.1109/PDIS.1994.331736

Filename

331736