Practical prefetching techniques for parallel file systems
David F. Kotz, Carla S. Ellis · International Conference on Parallel and Distributed Information Systems · 2002
Improvements in the processing speed of multiprocessors are outpacing improvements in the speed of disk hardware. Parallel disk I/O subsystems have been proposed as one way to close the gap between processor and disk speeds. In a previous paper the authors showed that prefetching and caching have the potential to deliver the performance benefits of parallel file systems to parallel applications. They describe experiments with practical prefetching policies, and show that prefetching can be implemented efficiently even for the more complex parallel file access patterns. They also test the ability of these policies across a range of architectural parameters. (see IEEE Trans. on Parallel and Distributed Systems, vol.1, no.2, p.218-30, 1990).>
Cited by 63 works. doi:10.1109/pdis.1991.183101
Authors
References
- Cache Memories
- A case for redundant arrays of inexpensive disks (RAID)
- A case for redundant arrays of inexpensive disks (RAID)
- A trace-driven analysis of the UNIX 4.2 BSD file system
- A trace-driven analysis of the UNIX 4.2 BSD file system
- Disk striping
- Disk cache—miss ratio analysis and design considerations
- Synchronized Disk Interleaving
- Sequential Program Prefetching in Memory Hierarchies
- Beating the I/O bottleneck: a case for log-structured file systems