Content-based Prefetching: Initial results

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

Volumn 2107, Issue , 2001, Pages 33-55

  Cooksey, Robert ^a   Colarelli, Dennis ^a   Grunwald, Dirk ^a  

^a UCB 450   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MEMORY ARCHITECTURE; TREES (MATHEMATICS);

ACCESS PATTERNS; DATA PRE-FETCHING; HIGH PERFORMANCE COMPUTERS; MEMORY ACCESS PATTERNS; MEMORY LATENCIES; PREDICTION MECHANISMS; SPARSE DATA STRUCTURES; STRIDE PREFETCHING;

CACHE MEMORY;

EID: 84945956077     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44570-6_3     Document Type: Conference Paper

References (30)

1. T. Alexander and G. Kedem. Distributed predictive cache design for high performance memory system. In Proceedings of the Second International Symposium on High-Performance Computer Architecture, San Jose, California, February 1996. IEEE Computer Society TCCA.
2. H-J. Boehm. Hardware and operating system support for conservative garbage collection. In IWMM, pages 61–67, Palo Alto, California, Oct 1991. IEEE Press.
3. D. Callahan, K. Kennedy, and A. Porterfield. Software prefetching. In Proceedings of the 4th International Conference on Architectural Support for Programming Languages and Operating Systems, pages 40–52, Santa Clara, CA, April 1991. ACM SIGARCH, SIGPLAN, SIGOPS, and the IEEE Computer Society.
4. M.C. Carlisle and A. Rogers. Software caching and computation migration in olden. In Proceedings of the 5th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 29–38. ACM, July 1995.
5. M.J. Charney and A.P. Reeves.: Generalized correlation based hardware prefetching. Technical Report EE-CEG-95-1, Cornell University, February 1995.
6. 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, MA, October 1992. ACM.
7. T-F. Chen and J-L. Baer. A performance study of software and hardware data prefetching schemes. In Proceedings of the 21st Annual International Symposium on Computer Architecture, pages 223–232, Chicago, IL, April 1994. ACM.
8. K.I. Farkas and N.P. Jouppi. Complexity/performance tradeoffs with non-blocking loads. In Proceedings of the 21st Annual International Symposium on Computer Architecture, pages 211–222, Chicago, IL, April 1994. ACM.
9. W-C. Hsu and J.E. Smith. A performance study of instruction cache prefetching methods. IEEE Transactions on Computers, 47(5):497–508, May 1998.
10. D. Joseph and D. Grunwald. Prefetching using Markov predictors. In Proceedings of the 24th Annual International Symposium on Computer Architecture, pages 252–263, Denver, CO, June 1997. ACM.
11. N.P. Jouppi. Improving direct-mapped cache performance by the addition of a small fullyassociative cache and prefetch buffers. In Proceedings of the 17th Annual International Symposium on Computer Architecture, pages 388–397. ACM, 1990.
12. M. Karlsson, F. Dahlgren, and P. Stenström. A prefetching technique for irregular accesses to linked data structures. In Proceedings of the Sixth International Symposium on High- Performance Computer Architecture, pages 206–217, Toulouse, France, January 2000. IEEE Computer Society TCCA.
13. D. Kroft. Lockup-free instruction fetch/prefetch cache organization. In Proceedings of the 8th Annual International Symposium on Computer Architecture, pages 81–87. ACM, 1981.
14. M.H. Lipasti, W.J. Schmidt, S.R. Kunkel, and R. R. Roediger. Spaid: Software prefetching in pointer and call intensive enviornments. In Proceedings of the 28th Annual International Symposium on Microarchitecture, pages 231–236, Ann Arbor, MI, November 1995. ACM.
15. C-K. Luk and T.C. 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, MA, October 1996. ACM.
16. C-K. Luk and T.C. Mowry. Automatic compiler-inserted prefetching for pointer-based applications. IEEE Transactions on Computers, 48(2):134–141, February 1999.
17. S. Mehrotra and L. Harrison. Examination of a memory access classification scheme for pointer-intensive and numeric programs. In Proceedings of the 1996 International Conference on Supercomputing, pages 133–140, Philadelphia, PA USA, May 1996. ACM.
18. T.C. Mowry, M.S. 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, MA, October 1992. ACM.
19. 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, MI, November 1995. ACM.
20. S. Palacharla and R.E. Kessler. Evaluating stream buffers as a secondary cache replacement. In Proceedings of the 21st Annual International Symposium on Computer Architecture, pages 24–33, Chicago, IL, April 1994. ACM.
21. S.S. Pinter and A. Yoaz. Tango: a hardware-based data prefetching technique for superscalar processors. In Proceedings of the 29th Annual International Symposium on Microarchitecture, pages 214–225, Paris, France, December 1996. ACM.
22. J. Pomerene et al. Prefetching system for a cache having a second directory for sequentially accessed blocks. Technical Report 4807110, U.S. Patent Office, Feb 1989.
23. A. Roger, M. Carlisle, J. Reppy, and L. Hendren. Supporting dynamic data structures on distributed memory machines. ACM Transactions on Programming Languages and Systems, 17(2), March 1995.
24. A. Roth, A. Moshovos, and G.S. Sohi. Dependance 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, CA, October 1998. ACM.
25. A. Roth and G.S. Sohi. Effective jump-pointer prefetching for linked data structures. In Proceedings of the 26th Annual International Symposium on Computer Architecture, pages 111–121, Atlanta, GA, May 1999. ACM.
26. T. Sherwood, S. Sair, and B. Calder. Predictor-directed stream buffers. In Proceedings of the 33th Annual International Symposium on Microarchitecture, Monterey, CA USA, December 2000. ACM.
27. V. Srinivasan, E. Davidson, and G. Tyson. A prefetch taxonomy. Technical Report CSE-TR- 424-00, University of Michigan, April 2000.
28. A. Srivastava and A. Eustace. Atom a system for building customized program analysis tools. In PLDI’94, pages 196–205, Orlando, FL, June 1994.
29. C-L. Yang and A.R. Lebeck.: Push vs. pull: Data movement for linked data structures. In Proceedings of the 2000 International Conference on Supercomputing, pages 176–186, Santa Fe, NM USA, May 2000. ACM.
30. L. Zhang, S.A. McKee, W.C. Hsieh, and J.B. Carter.: Pointer-based prefecthing within the Impulse adaptable memory controller: Initial results. In Solving the Memeory Wall Problem Workshop (ISCA 27), June 2000.