Prefetching in File Systems for MIMD Multiprocessors


Carla Schlatter Ellis and David Kotz. Prefetching in File Systems for MIMD Multiprocessors. Technical Report number CS-1988-23, Dept. of Computer Science, Duke University, November 1988. ©Copyright the authors. Later revised as ellis:prefetch.


The problem of providing file I/O to parallel programs has been largely neglected in the development of multiprocessor systems. There are two essential elements of any file system design intended for a highly parallel environment: parallel I/O and effective caching schemes. This paper concentrates on the second aspect of file system design and specifically, on the question of whether prefetching blocks of the file into the block cache can effectively reduce overall execution time of a parallel computation. MIMD multiprocessor architectures have a profound impact on the nature of the workloads they support. In particular, it is the collective behavior of the processes in a parallel computation that often determines the performance. The assumptions about file access patterns that underlie much of the work in uniprocessor file management are called into question. Results from experiments performed on the Butterfly Plus multiprocessor are presented showing the benefits that can be derived from prefetching (e.g. significant improvements in the cache miss ratio and the average time to perform an I/O operation). We explore why it is not trivial to translate these gains into much better overall performance.

Citable with [BibTeX]

Projects: [rapid-transit]

Keywords: [pario]

Available from the publisher: [pdf]

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

[Kotz research]