Integrating Theory and Practice in Parallel File Systems


Thomas H. Cormen and David Kotz. Integrating Theory and Practice in Parallel File Systems. Technical Report number PCS-TR93-188, Dept. of Math and Computer Science, Dartmouth College, March 1993. ©Copyright the authors. Revised 9/20/94. Revision of cormen:integrate.


Several algorithms for parallel disk systems have appeared in the literature recently, and they are asymptotically optimal in terms of the number of disk accesses. Scalable systems with parallel disks must be able to run these algorithms. We present a list of capabilities that must be provided by the system to support these optimal algorithms: control over declustering, querying about the configuration, independent I/O, turning off file caching and prefetching, and bypassing parity. We summarize recent theoretical and empirical work that justifies the need for these capabilities.

Citable with [BibTeX]

Projects: [pario]

Keywords: [pario]

Available from the publisher: [page]

Available from the author: [bib] [pdf] [ps.gz]
This pdf was produced by the publisher and its posting here is permitted by the publisher.

[Kotz research]