Issue No. 04 - July/August (2001 vol. 13)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.940734
<p><b>Abstract</b>—We present a novel data organization for disk arrays—<it>Segmented Information Dispersal</it> (SID). SID provides protection against disk failures while ensuring that the reconstruction of the missing data requires only relatively small contiguous accesses to the available disks. SID has a number of properties that make it an attractive solution for fault-tolerant video servers. Under fault-free conditions, SID performs as well as RAID 5 and organizations based on balanced incomplete block designs (BIBD). Under failure, SID performs much better than RAID 5 since it significantly reduces the size of the disk accesses performed by the reconstruction process. SID also performs much better than BIBD by ensuring the contiguity of the reconstruction accesses. Contiguity is a very significant factor for video retrieval workloads, as we demonstrate in this paper. We present SID data organizations with a concise representation which enables the reconstruction process to efficiently locate the needed video and check data.</p>
Algorithms, data structures, declustering, disk arrays, separated difference sets, video servers.
Ariel Cohen, Walter A. Burkhard, "Segmented Information Dispersal (SID) Data Layouts for Digital Video Servers", IEEE Transactions on Knowledge & Data Engineering, vol. 13, no. , pp. 593-606, July/August 2001, doi:10.1109/69.940734