OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Fault-Tolerant Distributed Mass Storage for LHC Computing
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
SRDS '96 Proceedings of the 15th Symposium on Reliable Distributed Systems
Stable Checkpointing in Distributed Systems without Shared Disks
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Data consistent up- and downstreaming in a distributed storage system
SNAPI '03 Proceedings of the international workshop on Storage network architecture and parallel I/Os
SNAPI '03 Proceedings of the international workshop on Storage network architecture and parallel I/Os
PVFS: a parallel file system for linux clusters
ALS'00 Proceedings of the 4th annual Linux Showcase & Conference - Volume 4
| Hi-index | 0.00 |
When distributing data across several nodes, two different approaches exist. The first one consists in distribution of the data object itself, e.g. in striping. The second approach is aggregation of local storages, whereby each data object is assigned to a home storage node. From the viewpoint of fault-tolerant data layouts, these schemes seem to be similar. In both cases the addition of parity, e.g. RAID level 3, level 5 or Reed-Solomon codes provide tolerance against node failures. A closer look shows differences in reachable access rates, needed number of messages and recovery cost. In this paper we compare both approaches and provide a method for self reconfiguration. The transformation from a parity grouping layout to a striping layout is shown to be feasible for stepwise and concurrent operation during data access.