A stateless, content-directed data prefetching mechanism

International Conference on Architectural Support for Programming Languages and Operating Systems - ASPLOS

Volumn , Issue , 2002, Pages 279-290

  Cooksey, Robert ^b   Jourdan, Stephan ^b   Grunwald, Dirk ^a  

^a UNIVERSITY OF COLORADO   (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER OPERATING SYSTEMS; COMPUTER SIMULATION; DATA STRUCTURES; JAVA PROGRAMMING LANGUAGE; MARKOV PROCESSES; MICROPROCESSOR CHIPS; PROGRAM COMPILERS; RESPONSE TIME (COMPUTER SYSTEMS); VIRTUAL REALITY;

CONTENT DIRECTED DATA PREFETCHING; POINTER INTENSIVE APPLICATIONS; VIRTUAL ADDRESSES;

STORAGE ALLOCATION (COMPUTER);

EID: 0345272014     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/605426.605427     Document Type: Conference Paper

References (13)

1. H.-J. Boehm. Hardware and operating system support for conservative garbage collection. In International Workshop on Memory Management, pages 61-67, Palo Alto, California, October 1991. IEEE Press.
2. M. Charney and A. Reeves. Generalized correlation based hardware prefetching. Technical Report EE-CEG-95-1, Cornell University, February 1995.
3. T.-F. Chen and J.-L. Baer. Reducing memory latency via non-blocking and prefetching caches. In Proceedings of the 5th International Conference on Architectural Support for Programming Languages and Operating Systems, pages 51-61, Boston, Massachusetts, October 1992. ACM.
4. J. Hennessey and D. Patterson. Computer Architecture: A Quantitative Approach. Second Edition. Morgan Kaufman Publishers, San Francisco, California, 1996.
5. D. Joseph and D. Grunwald. Prefetching using markov predictors. In Proceedings of the 24th Annual International Symposium on Computer Architecture, pages 252-263, Denver, Colorado, June 1997. ACM.
6. N. Jouppi. Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers. In Proceedings of the 17th Annual International Symposium on Computer Architecture, pages 388-397, 1990.
7. M. Lipasti, W. Schmidt, S. Kunkel, and R. Roediger. SPAID: Software prefetching in pointer and call intensive environments. In Proceedings of the 28th Annual International Symposium on Microarchitecture, pages 231-236, Ann Arbor, Michigan, November 1995. ACM.
8. C.-K. Luk and T. Mowry. Compiler-based prefetching for recursive data structures. In Proceedings of the 7th International Conference on Architectural Support for Programming Languages and Operating Systems, pages 222-233, Cambridge, Massachusetts, October 1996. ACM.
9. T. Mowry, M. Lam, and A. Gupta. Design and evaluation of a compiler algorithm for prefetching. In Proceedings of the 5th International Conference on Architectural Support for Programming Languages and Operating Systems, pages 62-73, Boston, Massachusetts, October 1992. ACM.
10. T. Ozawa, Y. Kimura, and S. Nishizaki. Cache miss heuristics an preloading techniques for general-purpose programs. In Proceedings of the 28th Annual International Symposium on Microarchitecture, pages 243-248, Ann Arbor, Michigan, November 1995. ACM.
11. S. Palacharla and R. Kessler. Evaluating stream buffers as a secondary cache replacement. In Proceedings of the 21st Annual International Symposium on Computer Architecture, pages 24-33, Chicago, Illinois, April 1994. ACM.
12. A. Roth, A. Moshovos, and G. Sohi. Dependence based prefetching for linked data structures. In Proceedings of the 8th International Conference on Architectural Support for Programming Languages and Operating Systems, pages 115-126, San Jose, California, October 1998. ACM.
13. C.-L. Yang and A. Lebeck. Push vs. pull: Data movement for linked data structures. In Proceedings of the 2000 International Conference on Supercomputing, pages 176-186, Santa Fe, New Mexico, May 2000. ACM.