A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Streaming RAID: a disk array management system for video files
MULTIMEDIA '93 Proceedings of the first ACM international conference on Multimedia
Staggered striping in multimedia information systems
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Efficient, distributed data placement strategies for storage area networks (extended abstract)
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Management of Physical Replicas in Parallel Multimedia in Information Systems
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
A Fast Algorithm for Online Placement and Reorganization of Replicated Data
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Taking advantage of heterogeneity in disk arrays
Journal of Parallel and Distributed Computing
SCADDAR: An Efficient Randomized Technique to Reorganize Continuous Media Blocks
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Characteristics of I/O traffic in personal computer and server workloads
IBM Systems Journal
AFRAID: a frequently redundant array of independent disks
ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
SLAS: An efficient approach to scaling round-robin striped volumes
ACM Transactions on Storage (TOS)
Design and Implementation of an Out-of-Band Virtualization System for Large SANs
IEEE Transactions on Computers
Distributing Orthogonal Redundancy on Adaptive Disk Arrays
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
Adaptive data block placement based on deterministic zones (adaptiveZ)
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II
FastScale: accelerate RAID scaling by minimizing data migration
FAST'11 Proceedings of the 9th USENIX conference on File and stroage technologies
MagicStore: a new out-of-band virtualization system in SAN environments
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
Design and Evaluation of a New Approach to RAID-0 Scaling
ACM Transactions on Storage (TOS)
CRAID: online RAID upgrades using dynamic hot data reorganization
FAST'14 Proceedings of the 12th USENIX conference on File and Storage Technologies
Hi-index | 0.00 |
Disk arrays level 5 (RAID5) are very commonly used in many environments. This kind of arrays has the advantage of parallel access, fault tolerance and little waste of space for redundancy issues. Nevertheless, this kind of storage architecture has a problem when more disks have to be added to the array. Currently, there is no simple, efficient and on-line mechanism to add any number of new disks (not replacing them), and this is an important drawback in systems that cannot be stopped when the storage capacity needs to be increased. We propose an algorithm to add N disks to an array while it continues running. The proposed algorithm for a gradual assimilation of disks has three major advantages: it has an easily controlled overhead, it allows the user to benefit from the higher parallelism achieved by the part of the array that has already been converted, and finally, it can be used in 7/24 systems.