Abstract
The paper introduces the idea of using the Information Dispersal Algorithm (IDA) of M.O. Rabin (1989) to distribute data and redundancy information uniformly among multiple disks and compares the performance and reliability characteristics of shadowing, parity, and IDA. It discusses some ways to take advantage of the uniformity of data placement and argues that IDA is the algorithm of choice for achieving reliability and performance in parallel disk systems.

This publication has 3 references indexed in Scilit: