Prefetch injection based on hardware monitoring and object metadata

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn 1, Issue , 2004, Pages 267-276

  Adl Tabatabai, Ali Reza ^a   Hudson, Richard L ^a   Serrano, Mauricio J ^a   Subramoney, Sreenivas ^a  

^a INTEL CORPORATION   (United States)

Author keywords

Cache misses; Compiler optimization; Garbage collection; Prefetching; Profile guided optimization; Virtual machines

Indexed keywords

BENCHMARKING; COMPUTER HARDWARE; DATA STRUCTURES; DYNAMIC RANDOM ACCESS STORAGE; INFORMATION MANAGEMENT; METADATA; OPTIMIZATION; PROGRAM COMPILERS; PROGRAM PROCESSORS;

CACHE MISSES; COMPILER OPTIMIZATION; GARBAGE COLLECTION; PREFETCHING; PROFILE-GUIDED OPTIMIZATION; VIRTUAL MACHINES;

CACHE MEMORY;

EID: 8344261610     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)

1. Adl-Tabatabai, A., Bharadwaj, J., Chen, D-Y, Ghuloum, A., Menon, V., Murphy, B., Serrano, M., and Shpeisman, T. The StarJIT Compiler: A Dynamic Compiler for Managed Runtime Environments. Intel Technology Journal, February 2003.
2. Adl-Tabatabai, A., Bharadwaj, J., Eng, M., Fang, J., Lewis, B.T., Murphy, B.R., Stichnoth, J., and Cierniak, M. Improving 64-bit Java IPF Performance by Compressing Heap References. In Code Generation and Optimization (CGO), 2004.
3. Cahoon, B., and McKinley, K. Data Flow Analysis for Software Prefetching Linked Data Structures in Java. In Parallel Architectures and Compilation Techniques (PACT), 2001.
4. Calder, B., Krintz, C., John, S., and Austin, T. Cache-Conscious Data Placement. In Architecture Support for Programming Languages and Operating Systems (ASPLOS), 1998.
5. Chilimbi, T., and Larus, J. Using Generational Garbage Collection To Implement Cache-Conscious Data Placement, In Proceedings of International Symposium on Memory Management (ISMM), 1998.
6. Chilimbi, T., and Hirzel, M. Dynamic Hot Data Stream Prefetching for General Purpose Programs. In Programming Languages Design and Implementation (PLDI), 2002.
7. Chilimbi, T., and Larus, J. Cache-conscious Structure Layout. In Programming Languages Design and Implementation (PLDI), 1999.
8. Chilimbi, T. Efficient Representations and Abstractions for Quantifying and Exploiting Data Reference Locality. In Programming Languages Design and Implementation (PLDI), 2001.
9. Cierniak, M., Eng, M., Glew, N., Lewis, B., and Stichnoth, J. The Open Runtime Platform: A Flexible High-Performance Managed Runtime Environment. Intel Technology Journal. http://developer.intel.com/technology/itj/2003/volume07issu e01, February 2003.
10. Collins, J., Wang, H., Tullsen, D., Hughes, C., Lee, Y-F., Lavery, D., and Shen, J. Speculative Precomputation: long-range prefetching of delinquent loads. In International Symposium of Computer Architecture (ISCA), 2001.
11. Dieckmann, S., and Hölze, U. A Study of the Allocation Behavior of the SPECjvm98 Java Benchmarks. In European Conference on Object-Oriented Programming (ECOOP), 1999.
12. Dimpsey, R., Arora, R., and Kuiper, K. Java Server Performance: A Case Study of Building Efficient, Scalable JVMs. IBM Systems Journal, 39(1):151-174, 2000.
13. Fenichel, R., and Yochelson, J., A Lisp Garbage Collector for Virtual Memory Computer Systems. Communications of the ACM, 12(11):611-612, November 1969.
14. Greenblatt, R. The LISP Machine; Working Paper No. 79, M.I.T. A. I. Lab, Cambridge MA (Nov 1974).
15. Hirzel, M., Diwan, A., and Hertz, M. Connectivity-Based Garbage Collection. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), 2003.
16. Hudson, R., Moss, J.E.B., Subramoney, S., and Washburn, W. Cycles to Recycle: Garbage Collection on the IA-64. In International Symposium on Memory Management (ISMM), 2000.
17. Hudson, R., and Moss, J.E.B. Copying Garbage Collection without stopping the world. Concurrency and Computation: Practice and Experience 15(3-5), 2003.
18. Inagaki, T., Onodera, T., Komatsu, H., and Nakatani, T. Stride Prefetching by Dynamically Inspecting Objects. In Programming Languages Design and Implementation (PLDI), 2003.
19. Intel Corp. IA-64 Application Developers Architecture Guide. May 1999.
20. Kim, D., Liao, S., Wang, P., Cuvillo, J., Tian, X., Zou, X., Wang, H., Yeung, D., Gikar, M., and Shen, J. Physical Experimentation with Prefetching Helper Threads on Intel's Hyper-Threaded Processors. In Code Generation and Optimization (CGO), 2003.
21. Lam, M., Wilson, P., and Moher, T. Object Type Directed Garbage Collection to Improve Locality. In International Workshop of Memory Management (IWMM), 1992.
22. Lu, J., Chen, H., Fu, R., Hsu, W-C, Othmer, B., Yew, P-C, and Chen, D-Y. The Performance of Runtime Data Cache Prefetching in a Dynamic Optimization System. In International Symposium on Microarchitecture (MICRO), Dec. 2003.
23. Luk, C-K, Muth, R., Patil, H., Weiss, R., Lowney, P.G., and Cohn, R. Profile-guided post-link stride prefetching. In International Conference on Supercomputing (ICS), 2002.
24. Jones, R., and Lins, R. Garbage Collection, Algorithms for Automatic Dynamic Memory Management. John Wiley and Sons, 1996.
25. Roth, A., and Sohi, G. Effective Jump Pointer Prefetching for Linked Data Structures. In International Symposium on Computer Architecture (ISCA), 1999.
26. Sair, S., Sherwood, T., and Calder, B. Quantifying Load Stream Behavior. In International Symposium on Microarchitecture (MICRO), 2002.
27. Shuf, Y., Serrano, M.J., Gupta, M., and Singh, J.P. Characterizing the Memory Behavior of Java Workloads: A Structured View and Opportunities for Optimizations. In Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), 2001.
28. Shuf, Y., Gupta, M., Franke, H., Appel, A., and Singh, J.P. Creating and Preserving Locality of Java Applications at Allocation and Garbage Collection Times. In Object-Oriented Programming Systems, Languages, and Applications (OOPSLA), 2002.
29. Standard Performance Evaluation Corporation. http://www.specbench.org.
30. VanderWiel, S. and Lilja, D. Data Prefetch Mechanisms. In ACM Computing Surveys, 2000.
31. White, J.L. Address/Memory Management for a Gigantic LISP Environment or, GC Considered Harmful. Conference Record of the 1980 LISP Conference, Stanford University, Palo Alto California.
32. Wilson, P.R., Lam, M.S., and Moher, T.G. Effective "Static- graph" Reorganization to Improve Locality in Garbage-Collected Systems. In Programming Languages Design and Implementation (PLDI), 1991.
33. Wu, Q., Pyatakov, A., Spiridonov, A., and August, D. Exposing Memory Access Regularities for Effective Memory Profiling. In Code Generation and Optimization (CGO), 2004.
34. Wu, Y., Serrano, M.J., Krishnaiyer, R., Li, W., and Fang, J. Value-Profile Guided Stride Prefetching for Irregular Code. In Compiler Construction Conference (CC), 2002.
35. Zhou, H., Flanagan, J., and Conte, T. Detecting Global Stride Locality in Value Streams. In International Symposium on Computer Architecture (ISCA), 2003.