Flexible usage of parity storage space in disk arrays

Authors:
Eric J. Schwabe;Ian M. Sutherland
Affiliations:
Department of EECS, Northwestern University, Evanston, IL;Department of EECS, Northwestern University, Evanston, IL
Venue:
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Year:
1996

A case for redundant arrays of inexpensive disks (RAID)

SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Failure correction techniques for large disk arrays

ASPLOS III Proceedings of the third international conference on Architectural support for programming languages and operating systems
Performance analysis of disk arrays under failure

Proceedings of the sixteenth international conference on Very large databases
Parity declustering for continuous operation in redundant disk arrays

ASPLOS V Proceedings of the fifth international conference on Architectural support for programming languages and operating systems
EVENODD: an optimal scheme for tolerating double disk failures in RAID architectures

ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
Evaluating approximately balanced parity-declustered data layouts for disk arrays

Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference
Improved parity-declustered layouts for disk arrays

Journal of Computer and System Sciences

Evaluating approximately balanced parity-declustered data layouts for disk arrays

Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference
A Gracefully Degradable Declustered RAID Architecture

Cluster Computing
QoS-oriented negotiation in disk subsystems

Data & Knowledge Engineering
Algorithms for memory hierarchies: advanced lectures

Algorithms for memory hierarchies: advanced lectures

Hi-index	0.00