Amortized efficiency of list update and paging rules
Communications of the ACM
Markov analysis of multiple-disk prefetching strategies for external merging
Theoretical Computer Science - Special issue on dependable parallel computing
RAID: high-performance, reliable secondary storage
ACM Computing Surveys (CSUR)
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
Simple randomized mergesort on parallel disks
Parallel Computing - Special double issue: parallel I/O
File server scaling with network-attached secure disks
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Competitive parallel disk prefetching and buffer management
Proceedings of the fifth workshop on I/O in parallel and distributed systems
A case for intelligent disks (IDISKs)
ACM SIGMOD Record
Design, Analysis, and Simulation of I/O Architectures for Hypercube Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Prefetching in File Systems for MIMD Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
An Evaluation of Storage Systems based on Network-attached Disks
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
Improving Parallel-Disk Buffer Management using Randomized Writeback
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
On Competitive On-Line Paging with Lookahead
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Near-optimal parallel prefetching and caching
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Optimal prefetching and caching for parallel I/O sytems
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Orthogonal Striping and Mirroring in Distributed RAID for I/O-Centric Cluster Computing
IEEE Transactions on Parallel and Distributed Systems
PC-OPT: Optimal Offline Prefetching and Caching for Parallel I/O Systems
IEEE Transactions on Computers
Analysis of simple randomized buffer management for parallel I/O
Information Processing Letters
Cache-Friendly implementations of transitive closure
Journal of Experimental Algorithmics (JEA)
Tight competitive ratios for parallel disk prefetching and caching
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Dynamic load balancing for I/O-intensive applications on clusters
ACM Transactions on Storage (TOS)
Hi-index | 0.00 |
The I/O performance of applications in multiple-disk systems can be improved by overlapping disk accesses. This requires the use of appropriate prefetching and buffer management algorithms that ensure the most useful blocks are accessed and retained in the buffer. In this paper, we answer several fundamental questions on prefetching and buffer management for distributed-buffer parallel I/O systems. First, we derive and prove the optimality of an algorithm, P-min, that minimizes the number of parallel I/Os. Second, we analyze P-con, an algorithm that always matches its replacement decisions with those of the well-known demand-paged MIN algorithm. We show that P-con can become fully sequential in the worst case. Third, we investigate the behavior of on-line algorithms for multiple-disk prefetching and buffer management. We define and analyze P-lru, a parallel version of the traditional LRU buffer management algorithm. Unexpectedly, we find that the competitive ratio of P-lru is independent of the number of disks. Finally, we present the practical performance of these algorithms on randomly generated reference strings. These results confirm the conclusions derived from the analysis on worst case inputs.