Virtual Striping: A Storage Management Scheme with Dynamic Striping

Kazuhiko MOGI; Masaru KITSUREGAWA

Virtual Striping: A Storage Management Scheme with Dynamic Striping

Kazuhiko MOGI, Masaru KITSUREGAWA

Full Text Views

0

Cite this

Summary :

RAID5 disk arrays provide high performance and high reliability for reasonable cost. However RAID5 suffers a performance penalty during block updates. In this paper, we propose a method to improve the small write performance of RAID5 disk arrays, named Virtual Striping. 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. In order to make free space for write operations, new garbage collection strategy is employed, where the linkage of blocks in a parity stripe is changed in Virtual Striping. The LFS (log-structured file system) based storage management scheme also writes new block onto large free area, which uses copying garbage collection. In this paper, we compare the performance of both methods through simulation. Although the write cost of Virtual Striping is more than that of the LFS based method, Virtual Striping has better performance than the LFS based method. This is due to the high efficiency of garbage collection in Virtual Striping.

Publication: IEICE TRANSACTIONS on Information Vol.E79-D No.8 pp.1086-1092

Publication Date: 1996/08/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Architectures, Algorithms and Networks for Massively Parallel Computing)

Category: Disk array

Cite this

Copy

Kazuhiko MOGI, Masaru KITSUREGAWA, "Virtual Striping: A Storage Management Scheme with Dynamic Striping" in IEICE TRANSACTIONS on Information, vol. E79-D, no. 8, pp. 1086-1092, August 1996, doi: .
Abstract: RAID5 disk arrays provide high performance and high reliability for reasonable cost. However RAID5 suffers a performance penalty during block updates. In this paper, we propose a method to improve the small write performance of RAID5 disk arrays, named Virtual Striping. 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. In order to make free space for write operations, new garbage collection strategy is employed, where the linkage of blocks in a parity stripe is changed in Virtual Striping. The LFS (log-structured file system) based storage management scheme also writes new block onto large free area, which uses copying garbage collection. In this paper, we compare the performance of both methods through simulation. Although the write cost of Virtual Striping is more than that of the LFS based method, Virtual Striping has better performance than the LFS based method. This is due to the high efficiency of garbage collection in Virtual Striping.
URL: https://global.ieice.org/en_transactions/information/10.1587/e79-d_8_1086/_p

Copy

@ARTICLE{e79-d_8_1086,
author={Kazuhiko MOGI, Masaru KITSUREGAWA, },
journal={IEICE TRANSACTIONS on Information},
title={Virtual Striping: A Storage Management Scheme with Dynamic Striping},
year={1996},
volume={E79-D},
number={8},
pages={1086-1092},
abstract={RAID5 disk arrays provide high performance and high reliability for reasonable cost. However RAID5 suffers a performance penalty during block updates. In this paper, we propose a method to improve the small write performance of RAID5 disk arrays, named Virtual Striping. 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. In order to make free space for write operations, new garbage collection strategy is employed, where the linkage of blocks in a parity stripe is changed in Virtual Striping. The LFS (log-structured file system) based storage management scheme also writes new block onto large free area, which uses copying garbage collection. In this paper, we compare the performance of both methods through simulation. Although the write cost of Virtual Striping is more than that of the LFS based method, Virtual Striping has better performance than the LFS based method. This is due to the high efficiency of garbage collection in Virtual Striping.},
keywords={},
doi={},
ISSN={},
month={August},}

Copy

TY - JOUR
TI - Virtual Striping: A Storage Management Scheme with Dynamic Striping
T2 - IEICE TRANSACTIONS on Information
SP - 1086
EP - 1092
AU - Kazuhiko MOGI
AU - Masaru KITSUREGAWA
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E79-D
IS - 8
JA - IEICE TRANSACTIONS on Information
Y1 - August 1996
AB - RAID5 disk arrays provide high performance and high reliability for reasonable cost. However RAID5 suffers a performance penalty during block updates. In this paper, we propose a method to improve the small write performance of RAID5 disk arrays, named Virtual Striping. 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. In order to make free space for write operations, new garbage collection strategy is employed, where the linkage of blocks in a parity stripe is changed in Virtual Striping. The LFS (log-structured file system) based storage management scheme also writes new block onto large free area, which uses copying garbage collection. In this paper, we compare the performance of both methods through simulation. Although the write cost of Virtual Striping is more than that of the LFS based method, Virtual Striping has better performance than the LFS based method. This is due to the high efficiency of garbage collection in Virtual Striping.
ER -