A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Parity declustering for continuous operation in redundant disk arrays
ASPLOS V Proceedings of the fifth international conference on Architectural support for programming languages and operating systems
Designing disk arrays for high data reliability
Journal of Parallel and Distributed Computing - Special issue on parallel I/O systems
Performance analysis of the RIO multimedia storage system with heterogeneous disk configurations
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
Orthogonal Striping and Mirroring in Distributed RAID for I/O-Centric Cluster Computing
IEEE Transactions on Parallel and Distributed Systems
DBMSs on a Modern Processor: Where Does Time Go?
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Internet growth: is there a "Moore's law" for data traffic?
Handbook of massive data sets
CoStore: A Storage Cluster Architecture Using Network Attached Storage Devices
ICPADS '02 Proceedings of the 9th International Conference on Parallel and Distributed Systems
Taking advantage of heterogeneity in disk arrays
Journal of Parallel and Distributed Computing
Technological impact of magnetic hard disk drives on storage systems
IBM Systems Journal
The Panasas ActiveScale Storage Cluster: Delivering Scalable High Bandwidth Storage
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Synthesizing Representative I/O Workloads for TPC-H
HPCA '04 Proceedings of the 10th International Symposium on High Performance Computer Architecture
Influence of Adaptive Data Layouts on Performance in Dynamically Changing Storage Environments
PDP '06 Proceedings of the 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing
Increasing the capacity of RAID5 by online gradual assimilation
SNAPI '04 Proceedings of the international workshop on Storage network architecture and parallel I/Os
Dynamic and Redundant Data Placement
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing 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
| Hi-index | 0.00 |
When upgrading storage systems, the key is migrating data from old storage subsystems to the new ones for achieving a data layout able to deliver high performance I/O, increased capacity and strong data availability while preserving the effectiveness of its location method. However, achieving such data layout is not trivial when handling a redundancy scheme because the migration algorithm must guarantee both data and redundancy will not be allocated on the same disk. The Orthogonal redundancy for instance delivers strong data availability for distributed disk arrays but this scheme is basically focused on homogeneous and static environments and a technique that moves overall data layout called re-striping is applied when upgrading it. This paper presents a deterministic placement approach for distributing orthogonal redundancy on distributed heterogeneous disk arrays, which is able to adapt on-line the storage system to the capacity/performance demands by only moving a fraction of data layout. The evaluation reveals that our proposal achieve data layouts delivering an improved performance and increased capacity while keeping the effectiveness of the redundancy scheme even after several migrations. Finally, it keeps the complexity of the data management at an acceptable level.