Synchronized Disk Interleaving
IEEE Transactions on Computers
Memory requirements for balanced computer architectures
ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
An Evaluation of Multiple-Disk I/O Systems
IEEE Transactions on Computers
Performance consequences of parity placement in disk arrays
ASPLOS IV Proceedings of the fourth international conference on Architectural support for programming languages and operating systems
Redundant disk arrays: reliable, parallel secondary storage
Redundant disk arrays: reliable, parallel secondary storage
The Performance of Parity Placements in Disk Arrays
IEEE Transactions on Computers
Proceedings of the Second International Conference on Data Engineering
Coding Techniques for Handling Failures in Large Disk Arrays
Coding Techniques for Handling Failures in Large Disk Arrays
Striping in disk array RM2 enabling the tolerance of double disk failures
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Reliability and performance of hierarchical RAID with multiple controllers
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A Practical Parity Scheme for Tolerating Triple Disk Failures in RAID Architectures
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
A cost effective fault-tolerant scheme for RAIDs
Journal of Computer Science and Technology
A multiple disk failure recovery scheme in RAID systems
Journal of Systems Architecture: the EUROMICRO Journal
Awarded Best Paper! -- Row-Diagonal Parity for Double Disk Failure Correction
FAST '04 Proceedings of the 3rd USENIX Conference on File and Storage Technologies
TRAP-Array: A Disk Array Architecture Providing Timely Recovery to Any Point-in-time
Proceedings of the 33rd annual international symposium on Computer Architecture
Multi-level RAID for very large disk arrays
ACM SIGMETRICS Performance Evaluation Review - Design, implementation, and performance of storage systems
CEFT: A cost-effective, fault-tolerant parallel virtual file system
Journal of Parallel and Distributed Computing
Performance of Two-Disk Failure-Tolerant Disk Arrays
IEEE Transactions on Computers
Uncomplicated recovering algorithm based on dual parity placement scheme in disk array systems
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
An XOR-based erasure-recovered algorithm for tolerating double disk failure in disk array systems
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
An analysis of data corruption in the storage stack
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
Prefetching with adaptive cache culling for striped disk arrays
ATC'08 USENIX 2008 Annual Technical Conference on Annual Technical Conference
An analysis of data corruption in the storage stack
ACM Transactions on Storage (TOS)
Higher reliability redundant disk arrays: Organization, operation, and coding
ACM Transactions on Storage (TOS)
Row-diagonal parity for double disk failure correction
FAST'04 Proceedings of the 3rd USENIX conference on File and storage technologies
ACM Transactions on Embedded Computing Systems (TECS)
protoRAID: a user-level RAID emulator for fast prototyping in fibre channel SAN environment
VECPAR'04 Proceedings of the 6th international conference on High Performance Computing for Computational Science
| Hi-index | 0.00 |
In this paper, we deal with the data/parity placement problem which is described as follows: how to place data and parity evenly across disks in order to tolerate two disk failures, given the number of disks N and the redundancy rate p which represents the amount of disk spaces to store parity information. To begin with, we transform the data/parity placement problem into the problem of constructing an N脳N matrix such that the matrix will correspond to a solution to the problem. The method to construct a matrix has been proposed and we have shown how our method works through several illustrative examples. It is also shown that any matrix constructed by our proposed method can be mapped into a solution to the placement problem if a certain condition holds between N and p where N is the number of disks and p is a redundancy rate.