Abstract : This report is the result of knowledge gained in designing and implementing software for RAID-I (RAID the First), a prototype RAID level 5 system designed and built at the University of California at Berkeley. RAID-I is currently fully operational and should soon be available as a network file server. The main purpose of RAID-I is to prototype RAID specific software, gain experience with SCSI, and foresee performance bottlenecks in the implementation of more advanced RAID systems currently being designed at Berkeley. The following assumes that the reader is familiar with RAID systems. The earlier sections of this document are concerned with describing the RAID-I software. Specifically, they describe how logical RAID block addresses (block number) are mapped to physical disk addresses (disk, sector), how IO requests are serviced, and how the recovery mechanism reconstructs the contents of failed disks concurrently with user request servicing. The latter sections investigate the performance consequences of various parity placement schemes. In particular, we find that at relatively large request sizes, on the order of a few hundred kilobytes, the choice of parity placement can cause significant differences in performance.
[1]
Randy H. Katz,et al.
Disk system architectures for high performance computing
,
1989,
Proc. IEEE.
[2]
Peter Dibble,et al.
A parallel interleaved file system
,
1990
.
[3]
Randy H. Katz,et al.
A case for redundant arrays of inexpensive disks (RAID)
,
1988,
SIGMOD '88.
[4]
Randy H. Katz,et al.
Introduction to redundant arrays of inexpensive disks (RAID)
,
1989,
Digest of Papers. COMPCON Spring 89. Thirty-Fourth IEEE Computer Society International Conference: Intellectual Leverage.
[5]
Michelle Y. Kim,et al.
Synchronized Disk Interleaving
,
1986,
IEEE Transactions on Computers.
[6]
Miron Livny,et al.
Multi-disk management algorithms
,
1987,
SIGMETRICS '87.
[7]
Hector Garcia-Molina,et al.
Disk striping
,
1986,
1986 IEEE Second International Conference on Data Engineering.