Parallel prefetching and caching is hard

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2996, Issue , 2004, Pages 211-221

  Ambühl, Christoph ^a   Weber, Birgitta ^b  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION;

NP-HARD; OPTIMAL PROCESSING; PARALLEL DISK SYSTEMS; PREFETCHING;

APPROXIMATION ALGORITHMS;

EID: 15844431952     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24749-4_19     Document Type: Article

References (13)

1. S. Albers and M. Bülttner. Integrated prefetching and caching in single and parallel disk systems. In Proc. 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press, 2003.
2. S. Albers, N. Garg, and S. Leonardi. Minimizing stall time in single and parallel disk systems. Journal of the ACM (JACM), 47(6):969-986, 2000. Preliminary version in STOC98.
3. S. Albers and C. Witt. Minimizing stall time in single and parallel disk systems using multicommodity network flows. In Proc. 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX01), pages 12-23. Springer-Verlag LNCS 1665, 2001.
4. L.A. Belady. A study of replacement algorithms for virtual-storage computer. IBM Systems Journal, 5(2), 1966.
5. P. Cao, E.W. Feiten, A.R. Karlin, and K. Li. A study of integrated prefetching and caching strategies. In Proc ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), pages 188-197, 1995.
6. A. Gaysinsky, A. Itai, and H. Shachnai. Strongly competitive algorithms for caching with pipelined prefetching. In Proc. 9th Annual European Symposium on Algorithms (ESA01), pages 49 -61. Springer-Verlag LNCS 2161, 2001.
7. D.A. Hutchinson, P. Sanders, and J.S. Vitter. Duality between prefetching and queued writing with parallel disks. In Proc. 9th Annual European Symposium on Algorithms (ESA01), pages 62-73. Springer-Verlag LNCS 2161, 2001.
8. M. Kallahalla and P.J. Varman. Optimal prefetching and caching for parallel i/o systems. In Proc. 13th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 219-228. ACM Press, 2001.
9. T. Kimbrel. Parallel Prefetching and Caching. PhD thesis, University of Washington, 1997.
10. T. Kimbrel, P. Cao, E.W. Feiten, A.R. Karlin, and K. Li. Integrated parallel prefetching and caching. In Proc ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), pages 262-263, 1996.
11. T. Kimbrel and A.R. Karlin. Near-optimal parallel prefetching and caching. SIAM Journal on Computing, 29(4):1051-1082, 2000. Preliminary version in FOCS96.
12. E. W. Mayr, H. J. Prömel, and A. Steger, editors. Lectures on Proof Verification and Approximation Algorithms. Springer-Verlag LNCS 1367, 1998.
13. J.S. Vitter and E.A.M. Shriver. Algorithms for parallel memory, I: Two-level memories. Algorithmica, 12(2-3):110-147, 1994.