Download:
|
by Susanne Albers, Naveen Garg, Stefano Leonardi
In Proc. of 30th Annual ACM Symp. on Theory of Computer Science
http://ls2-www.cs.uni-dortmund.de/~albers/stoc98.ps.gz
Add To MetaCart
Abstract:
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algorithms for minimizing the total elapsed time in single and parallel disk settings. The total elapsed time is the sum of the processor stall times and the length of the request sequence to be served. We show that an optimum prefetching/caching schedule for a single disk problem can be computed in polynomial time, thereby settling an open question by Kimbrel and Karlin. For the parallel disk problem we give an approximation algorithm for minimizing stall time. Stall time is an important and harder to approximate measure for this problem. All of our algorithms are based on a new approach which involves formulating the prefetching/caching problems as integer programs. 1
Citations
|
972
|
Theory of Linear and Integer Programming
– Schrijver
- 1986
|
|
634
|
Amortized efficiency of list update and paging rules
– Sleator, Tarjan
- 1985
|
|
387
|
A study of replacement algorithms for virtual storage computers. IBMSystems Journal
– Belady
- 1966
|
|
301
|
Informed prefetching and caching
– Patterson, Gibson, et al.
- 1995
|
|
224
|
Practical Prefetching via Data Compression
– Curewitz, Krishnan, et al.
- 1993
|
|
173
|
A Study of Integrated Prefetching and Caching Strategies
– Cao, Felten, et al.
|
|
157
|
Competitive paging algorithms
– Fiat, Karp, et al.
- 1991
|
|
116
|
Fido: A cache that learns to fetch
– Palmer, Zdonik
- 1991
|
|
114
|
Competitive paging with locality of reference
– Borodin, Irani, et al.
- 1995
|
|
99
|
Implementation and performance of integrated application-controlled file caching, prefetching, and disk scheduling
– Cao, Felten, et al.
- 1996
|
|
91
|
A TraceDriven Comparison of Algorithms for Parallel Prefetching and Caching
– Kimbrel, Tomkins, et al.
- 1996
|
|
84
|
Prefetching in File Systems for MIMD Multiprocessors
– Kotz, Ellis
- 1990
|
|
67
|
Near-optimal Parallel Prefetching and Caching
– Kimbrel, Karlin
- 1996
|
|
64
|
Markov paging
– Karlin, Phillips, et al.
|
|
33
|
Experimental studies of access graph based heuristics: Beating the LRU standard
– Fiat, Rosen
- 1997
|
|
33
|
Optimal Prediction for Prefetching in the Worst Case
– Krishnan, Vitter
- 1994
|
|
10
|
Fast approximation algorithm for minimum cost multicommodity flow
– Kamath, Palmon, et al.
- 1995
|
|
5
|
Prefetching and I/O Parallelism in Multiple Disk Systems
– Lee, Varman
- 1995
|
|
3
|
Randomized and multiprocessor paging with locality of reference
– Fiat, Karlin
- 1995
|
|
3
|
Parallel prefetching and caching (PhD thesis
– Kimbrel
- 1997
|
|
3
|
Practical prefetching techniques for mulitprocessor file systems
– Kotz, Ellis
- 1993
|
|
1
|
Near-optimal parallel prefetching anch caching
– Kimbrel, Karlin
- 1996
|
|
1
|
A trace-driven comparison of algorithms for parallel prefetching and caching
– Bershad, Cao, et al.
- 1996
|
