ACM Transactions on Computer Systems (TOCS)
Caching in the Sprite network file system
ACM Transactions on Computer Systems (TOCS)
A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
An Evaluation of Multiple-Disk I/O Systems
IEEE Transactions on Computers
Coda: A Highly Available File System for a Distributed Workstation Environment
IEEE Transactions on Computers
The design and implementation of a log-structured file system
ACM Transactions on Computer Systems (TOCS)
Practical prefetching techniques for multiprocessor file systems
Distributed and Parallel Databases - Selected papers from the first international conference on parallel and distributed information systems
A study of integrated prefetching and caching strategies
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Informed prefetching and caching
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
ACM Transactions on Computer Systems (TOCS)
A trace-driven comparison of algorithms for parallel prefetching and caching
OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
Near-Optimal Parallel Prefetching and Caching
SIAM Journal on Computing
Exposing I/O concurrency with informed prefetching
PDIS '94 Proceedings of the third international conference on on Parallel and distributed information systems
Fido: A Cache That Learns to Fetch
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Application-controlled file caching policies
USTC'94 Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1
Reducing file system latency using a predictive approach
USTC'94 Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1
| Hi-index | 0.00 |
I/O for parallel and distributed systems has drawn increasing attention over the past decade as it has become apparent that I/O performance, rather than CPU performance, may be the key limiting factor in the performance of future systems. Prefetch is the fundamental approach for improving the overall read performance. At present, there are some well-known prefetching algorithms in parallel and distributed systems, such as LRU-Lookahead, Fixed Horizon, and Greedy algorithmin. In this paper, we study these parallel prefetching algorithms and explore the performance characteristics of each of the algorithms using the trace-driven simulation. We find that when performance is limited by I/O stall, aggressive prefetch helps to alleviate the problem. However, conservative prefetch performs well in computingbound situations. Moreover, we find that carefully choosing replacement decision is not necessary to balance the load across the disks when the data is well laid out.