Strongly competitive algorithms for caching with pipelined prefetching

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

Volumn 2161, Issue , 2001, Pages 49-61

  Gaysinsky, Alexander ^a   Itai, Alon ^a   Shachnai, Hadas ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; PROGRAM PROCESSORS;

COMPETITIVE ALGORITHMS; DETERMINISTIC ALGORITHMS; DIRECTED ACYCLIC GRAPH (DAG); FOLLOWING PROBLEM; LOCALITY OF REFERENCE; MEMORY CONTROLLER; OVERALL EXECUTION; PERFORMANCE RATIO;

PIPELINES;

EID: 84943261703     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44676-1_4     Document Type: Conference Paper

References (23)

1. D. Bhandarkar, J. Ding, "Performance Characterization of the Pentium Pro Pro-cessor", 3rd International Symposium on High Performance Computer Architecture, San Antonio, 1997.
2. A. Borodin, S. Irani, P. Raghavan and B. Schieber, "Competitive Paging with Locality of Reference", Journal of Computer and System Science, 1995, pp. 244-258.
3. A. Borodin and R. El-Yaniv, "Competitive Analysis and Online Computation", Cambridge University Press, 1998.
4. P. Cao, E. Felton, A. Karlin, K. Li, "A Study of Integrated Prefetching and Caching Strategies", SIGMETRICS/PERFORMANCE, 1995.
5. A. Fiat and G. J. Woeginger, "Online Algorithms, The State of the Art", Springer, 1998 (LNCS #1442).
6. A. Fiat and A. R. Karlin, "Randomized and Multipointer Paging with Locality of Reference", STOC, 1995.
7. A. Fiat and Z. Rosen, "Experimental Studies of access Graph Based Heuristics: Beating the LRU Standard?", SODA, 1997.
8. A. Fiat and M. Mendel, "Truly Online Paging with Locality of Reference", FOCS, 1997.
9. A. Gaysinsky, A. Itai and H. Shachnai. "Strongly Competitive Algorithms for Caching with Pipelined Prefetching", full version. http://www.cs.technion.ac.il/_hadas/PUB/clpp.ps.gz.
10. D.S. Hochbaum, Approximation Algorithms for NP-Hard Problems, PUS Publish-ing Company, 1995.
11. S. Irani, A. R. Karlin and S. Phillips, "Strongly competitive algorithms for paging with locality of reference", SIAM Journal Comput., June 1996, pp. 477-497.
12. A. R. Karlin, T. Kimbrel, "Near-optimal parallel prefetching and caching", CS TR, Washington Univ., 1996.
13. A. R. Karlin, S. Phillips and P. Raghavan, "Markov paging", FOCS 1992.
14. D. E. Knuth, The Art of Computer Programming, Vol. 3, Addison Wesley, 1973.
15. S. Lang, Algebra, Columbia University, New York, 153-155, 1965.
16. R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
17. P. Raghavan, H. Shachnai, M. Yaniv, "Dynamic Schemes for Speculative Execution of Code", MASCOTS, 1998.
18. A. Tomkins, R. H. Patterson and G. Gibson. "Informed Multi-Process Prefetching and Caching", SIGMETRICS, 1997.
19. R. Sedgewick and P. Flajolet, An Introduction to the Analysis of Algorithms, Addison-Wesley Publishing, 1996.
20. A.K. Uht and V. Sindagi, "Disjoint Eager Execution: An optimal form of speculative execution", MICRO-28, 1995.
21. G. M. Voelker, E. J. Anderson, T. Kimbrel, M. J. Feeley, J. S. Chase, A. R. Karlin and H. M. Levy, "Implementing Cooperative Prefetching and Caching in Globally-Managed Memory System". SIGMETRICS, 1998.
22. S. S. H. Wang and A. K. Uht, "Ideograph/Ideogram: Framework/Architecture for Eager Evaluation", MICRO-23, 1990.
23. M. Yaniv, "Dynamic Schemes for Speculative Execution of Code", M.Sc. Thesis, Dept. of Computer Science, The Technion, 1998.