A Double-Objective Genetic Algorithm for Parity Declustering Optimization in Networked RAID

RAID, as a popular technology to improve the performance and reliability of storage system, has been used widely in computer industry. Recently, the technique of designing data layout in order to fit the requirements of networked storage is becoming a new challenge in this field. In this paper, we present a double-objective Genetic Algorithm for parity declustering optimization in networked RAID with a modified NSGA, we also take Distributed recovery workload and Distributed parity as two objects to find optimal data layout for parity declustering in networked RAID.

[1]  Peter J. Fleming,et al.  Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.

[2]  Flaviu Cristian,et al.  Declustered disk array architectures with optimal and near-optimal parallelism , 1998, ISCA.

[3]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[4]  Lino A. Costa,et al.  An elitist genetic algorithm for multiobjective optimization , 2004 .

[5]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[6]  C. Fonseca,et al.  GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION , 1993 .

[7]  Eric J. Schwabe,et al.  Evaluating approximately balanced parity-declustered data layouts for disk arrays , 1996, IOPADS '96.

[8]  Near-optimal Parallelism.  Declustered Disk Array Architectures with Optimal and , 1998 .

[9]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[10]  Randy H. Katz,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988, SIGMOD '88.

[11]  Daniel P. Siewiorek,et al.  Architectures and algorithms for on-line failure recovery in redundant disk arrays , 1994, Distributed and Parallel Databases.

[12]  Eric J. Schwabe,et al.  Evaluating Approximately Balanced Parity-Declustered Data Layouts for Disk Arrays , 1997, Parallel Comput..

[13]  John C. S. Lui,et al.  Performance Analysis of Disk Arrays under Failure , 1990, VLDB.

[14]  David E. Goldberg,et al.  A niched Pareto genetic algorithm for multiobjective optimization , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[15]  Walter A. Burkhard,et al.  Permutation Development Data Layout (PDDL) Disk Array Declustering , 2002 .

[16]  Walter A. Burkhard,et al.  Permutation development data layout (PDDL) , 1999, Proceedings Fifth International Symposium on High-Performance Computer Architecture.