Database reorganization in parallel disk arrays with I/O service stealing
We present a model for data reorganization in parallel disk systems that is geared toward load balancing in an environment with periodic access patterns. Data reorganization is performed by disk cooling, i.e., migrating files or extents from the hottest disks to the coldest ones. We develop an appro...
Saved in:
Published in | IEEE transactions on knowledge and data engineering Vol. 10; no. 5; pp. 855 - 858 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
New York, NY
IEEE
01.09.1998
IEEE Computer Society |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | We present a model for data reorganization in parallel disk systems that is geared toward load balancing in an environment with periodic access patterns. Data reorganization is performed by disk cooling, i.e., migrating files or extents from the hottest disks to the coldest ones. We develop an approximate queueing model for determining the effective arrival rates of cooling requests and discuss its use in assessing the costs versus benefits of cooling actions. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 1041-4347 1558-2191 |
DOI: | 10.1109/69.729749 |