Sciweavers

165 search results - page 1 / 33
» Performance Analysis of Disk Arrays under Failure
Sort
View
VLDB
1990
ACM
80views Database» more  VLDB 1990»
13 years 8 months ago
Performance Analysis of Disk Arrays under Failure
Disk arrays (RAID) have been proposed as a possible approach to solving the emerging I/O bottleneck problem. The performance of a RAID system when all disks are operational and th...
Richard R. Muntz, John C. S. Lui
HPCA
1999
IEEE
13 years 9 months ago
Permutation Development Data Layout (PDDL)
Declustered data organizations in disk arrays (RAIDs) achieve less-intrusive reconstruction of data after a disk failure. We present PDDL, a new data layout for declustered disk a...
Thomas J. E. Schwarz, Jesse Steinberg, Walter A. B...
FTCS
1993
123views more  FTCS 1993»
13 years 6 months ago
Fast, On-Line Failure Recovery in Redundant Disk Arrays
This paper describes and evaluates two algorithms for performing on-line failure recovery (data reconstruction) in redundant disk arrays. It presents an implementation of disk-ori...
Mark Holland, Garth A. Gibson, Daniel P. Siewiorek
ISCA
1993
IEEE
115views Hardware» more  ISCA 1993»
13 years 9 months ago
Parity Logging Overcoming the Small Write Problem in Redundant Disk Arrays
Parity encoded redundant disk arrays provide highly reliable, cost effective secondary storage with high performance for read accesses and large write accesses. Their performance ...
Daniel Stodolsky, Garth A. Gibson, Mark Holland
ISCA
1998
IEEE
144views Hardware» more  ISCA 1998»
13 years 9 months ago
Declustered Disk Array Architectures with Optimal and Near-Optimal Parallelism
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 faile...
Guillermo A. Alvarez, Walter A. Burkhard, Larry J....