article · 1993

Integrating Theory And PracticeIn Parallel File Systems

Thomas H. Cormen, David Kotz

Cited by 0Abstract and details only

Abstract

Several algorithms forparallel disk systems haveappeared in the literature recently, and they are asymptotically optimal in terms ofthe number of disk accesses. Scalable systems with parallel disks must be able to run these algorithms. We present for the rst time alist of capabilities that must be provided by the system to support these optimal algorithms: control over declustering, querying about the con guration, independent I/O, and turning o parity, le caching, and prefetching. We summarizerecent theoretical and empirical work that justi es the need for these capabilities. In addition, we sketch anorganization for a parallel le interface with low-level primitives and higher-level operations. 1

Cite this paper

APA 7

Cormen, T. H., & Kotz, D. (1993). Integrating Theory And PracticeIn Parallel File Systems.

MLA 9

Cormen, Thomas H., and David Kotz. “Integrating Theory And PracticeIn Parallel File Systems.” 1993.

Chicago

Cormen, Thomas H., and David Kotz. 1993. “Integrating Theory And PracticeIn Parallel File Systems.”

Harvard

Cormen, T.H. and Kotz, D. (1993) ‘Integrating Theory And PracticeIn Parallel File Systems’.

BibTeX

@article{cormen1993integrating,
  title = {{Integrating Theory And PracticeIn Parallel File Systems}},
  author = {Cormen, Thomas H. and Kotz, David},
  year = {1993}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.