Declustered disk array architectures with optimal and near-optimal parallelism

  • Authors:

  • Guillermo A. Alvarez;Walter A. Burkhard;Larry J. Stockmeyer;Flaviu Cristian

  • Affiliations:

  • Gemini Storage Systems Laboratory and Dependable Systems Laboratory, Department of Computer Science and Engineering, University of California, San Diego, La Jolla, CA;Gemini Storage Systems Laboratory, Department of Computer Science and Engineering, University of California, San Diego, La Jolla, CA;IBM Research Division, Almaden Research Center, 650 Harry Road, San Jose, CA;Dependable Systems Laboratory, Department of Computer Science and Engineering, University oi California, San Diego, La Jolla, CA

  • Venue:
  • Proceedings of the 25th annual international symposium on Computer architecture
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper investigates the placement of data and parity on redundant disk arrays. Declustered organizations have been traditionally used to achieve fast reconstruction of a failed disk's contents. In previous work, Holland and Gibson identified six desirable properties for ideal layouts; however, no declustered layout satisfying all properties has been published in the literature. We present a complete, constructive characterization of the collection of ideal declustered layouts possessing all six properties. Given that ideal layouts exist only for a limited set of configurations, we also present two novel layout families. PRIME and RELPR can tolerate multiple failures in a wide variety of configurations with slight deviations from the ideal. Our simulation studies show that the new layouts provide excellent parallel access performance and reduced incremental loads during degraded operation, when compared with previously published layouts. For large accesses and under high loads, response times for the new layouts are typically smaller than those of previously published declustered layouts by a factor of 2.5.