Distributed Storage Layout Schemes

Abstract

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.

Original languageEnglish
Title of host publication19th IEEE International Parallel and Distributed Processing Symposium
PublisherIEEE
Publication date01.12.2005
Article number1420248
ISBN (Print)0-7695-2312-9, 978-076952312-5
DOIs
Publication statusPublished - 01.12.2005
Event19th IEEE International Parallel and Distributed Processing Symposium - Denver , United States
Duration: 04.04.200508.04.2005
Conference number: 67370

Fingerprint

Dive into the research topics of 'Distributed Storage Layout Schemes'. Together they form a unique fingerprint.

Cite this