Practical prefetching techniques for parallel file systems
- 10 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 182-189
- https://doi.org/10.1109/pdis.1991.183101
Abstract
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 we showed that prefetching and caching have the potential to deliver te performance benefits of parallel file systems to parallel applications. In this paper we describe experiments with practical prefetching policies, and show that prefetching can be implemented efficiently even for the more complex parallel file access patterns. We also test the ability of these policies across a range of architectural parameters.Keywords
This publication has 16 references indexed in Scilit:
- Bridge: a high performance file system for parallel processorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Caching and writeback policies in parallel file systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Input/output behavior of supercomputing applicationsPublished by Association for Computing Machinery (ACM) ,1991
- Beating the I/O bottleneck: a case for log-structured file systemsACM SIGOPS Operating Systems Review, 1989
- A case for redundant arrays of inexpensive disks (RAID)Published by Association for Computing Machinery (ACM) ,1988
- Disk stripingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- A trace-driven analysis of the UNIX 4.2 BSD file systemPublished by Association for Computing Machinery (ACM) ,1985
- Cache MemoriesACM Computing Surveys, 1982
- Sequential Program Prefetching in Memory HierarchiesComputer, 1978
- Sequentiality and prefetching in database systemsACM Transactions on Database Systems, 1978