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
Performance of a disk array protype
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
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
The TickerTAIP parallel RAID architecture
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
The TickerTAIP parallel RAID architecture
ACM Transactions on Computer Systems (TOCS)
Ordering disks for double erasure codes
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Cluttered Orderings for the Complete Graph
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Optimal and pessimal orderings of Steiner triple systems in disk arrays
Theoretical Computer Science - Latin American theoretical informatics
Design and implementation of a network-wide concurrent file system in a workstation cluster
MSS '95 Proceedings of the 14th IEEE Symposium on Mass Storage Systems
Ladder orderings of pairs and RAID performance
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Ladder orderings of pairs and RAID performance
Discrete Applied Mathematics
Hi-index | 0.00 |
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 at Berkeley. The following assumes that the reader is familiar with RAID [3, 7, 8] systems.