Efficient Technique for Overcoming Data Migration in Dynamic Disk Arrays

We introduce a new concept for storage management on multi-disk systems, called dynamic redundancy. It associates the redundancy level which characterizes the storage organization to sets of data and not to storage areas while minimizing data migration for reconfiguration. The result is a high quality multi-disk storage system, capable to support various storage organizations at once. It provides transformations between them with a minimum of (if any) data migration.

[1]  Carl Staelin,et al.  The HP AutoRAID hierarchical storage system , 1995, SOSP.

[2]  Peter M. Chen,et al.  Striping in a RAID level 5 disk array , 1995, SIGMETRICS '95/PERFORMANCE '95.

[3]  Randy H. Katz,et al.  Disk system architectures for high performance computing , 1989, Proc. IEEE.

[4]  Hector Garcia-Molina,et al.  Disk striping , 1986, 1986 IEEE Second International Conference on Data Engineering.

[5]  Miron Livny,et al.  Multi-disk management algorithms , 1987, SIGMETRICS '87.

[6]  Masaru Kitsuregawa,et al.  Hot mirroring: a method of hiding parity update penalty and degradation during rebuilds for RAID5 , 1996, SIGMOD '96.

[7]  Randy H. Katz,et al.  Introduction to redundant arrays of inexpensive disks (RAID) , 1989, Digest of Papers. COMPCON Spring 89. Thirty-Fourth IEEE Computer Society International Conference: Intellectual Leverage.

[8]  Randy H. Katz,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988, SIGMOD '88.