Title

Shifted Declustering: A Placement-Ideal Layout Scheme For Multi-Way Replication Storage Architecture

Keywords

Data layout; Multi-way replication; Optimal parallelism

Abstract

Recent years have seen a growing interest in the deployment of sophisticated replication based storage architecture in data-intensive computing. Existing placement-ideal data layout solutions place an emphasis on declustered parity based storage. However, there exist major differences between parity and replication architectures, especially in data layouts. We retrofit the desirable properties of optimal parallelism in parity architectures for replication architectures, and propose a novel placement-ideal data layout - shifted declustering for replication based storage. Shifted declustering layout obtains optimal parallelism in a wide range of configurations, and obtains optimal high performance and load balancing in both fault-free and degraded modes. Our theoretical proofs and comprehensive simulation results show that shifted declustering is superiour in performance and load balancing to traditional replication layout schemes such as standard mirroring, chained declustering, group rotational declustering and existing parity layout schemes PRIME and RELPR in reference [4]. Copyright 2008 ACM.

Publication Date

12-15-2008

Publication Title

Proceedings of the International Conference on Supercomputing

Number of Pages

134-144

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

DOI Link

https://doi.org/10.1145/1375527.1375549

Socpus ID

57349200230 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/57349200230

This document is currently not available here.

Share

COinS