Amortized efficiency of list update and paging rules
Communications of the ACM
The input/output complexity of sorting and related problems
Communications of the ACM
Journal of Algorithms
Markov analysis of multiple-disk prefetching strategies for external merging
Theoretical Computer Science - Special issue on dependable parallel computing
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
Early experiences in evaluating the parallel disk model with the ViC implementation
Parallel Computing - Special double issue: parallel I/O
Simple randomized mergesort on parallel disks
Parallel Computing - Special double issue: parallel I/O
Automatic I/O hint generation through speculative execution
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Optimal read-once parallel disk scheduling
Proceedings of the sixth workshop on I/O in parallel and distributed systems
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
R × W: a scheduling approach for large-scale on-demand data broadcast
IEEE/ACM Transactions on Networking (TON)
Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems
IEEE Transactions on Parallel and Distributed Systems
Fast concurrent access to parallel disks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Near-Optimal Parallel Prefetching and Caching
SIAM Journal on Computing
Competitive parallel disk prefetching and buffer management
Journal of Algorithms
Minimizing stall time in single and parallel disk systems
Journal of the ACM (JACM)
Prefetching in File Systems for MIMD Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
On Competitive On-Line Paging with Lookahead
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
An Adaptive Cache Coherence Protocol Specification for Parallel Input/Output Systems
IEEE Transactions on Parallel and Distributed Systems
Coupling prefix caching and collective downloads for remote dataset access
Proceedings of the 20th annual international conference on Supercomputing
Optimal multistream sequential prefetching in a shared cache
ACM Transactions on Storage (TOS)
Prefetching with adaptive cache culling for striped disk arrays
ATC'08 USENIX 2008 Annual Technical Conference on Annual Technical Conference
Implementation and Evaluation of File Write-Back and Prefetching for MPI-IO Over GPFS
International Journal of High Performance Computing Applications
PRE-BUD: Prefetching for energy-efficient parallel I/O systems with buffer disks
ACM Transactions on Storage (TOS)
Scheduling multiple flows on parallel disks
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
| Hi-index | 14.98 |
We address the problem of prefetching and caching in a parallel I/O system and present a new algorithm for parallel disk scheduling. Traditional buffer management algorithms that minimize the number of block misses are substantially suboptimal in a parallel I/O system where multiple I/Os can proceed simultaneously. We show that in the offline case, where a priori knowledge of all the requests is available, PC-OPT performs the minimum number of I/Os to service the given I/O requests. This is the first parallel I/O scheduling algorithm that is provably offline optimal in the parallel disk model.In the online case, we study the context of global L-block lookahead, which gives the buffer management algorithm a lookahead consisting of L distinct requests. We show that the competitive ratio of PC-OPT, with global L-blocklookahead, is \Theta (M - L + D), when L M, where the number of disks is D and buffer size is M.