Procedure placement using temporal-ordering information

ACM Transactions on Programming Languages and Systems

Volumn 21, Issue 5, 1999, Pages 977-1027

  Gloy, Nikolas ^a   Smith, Michael D ^b  

^a Appliant Inc   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

Algorithms; Code placement; Conflict misses; Optimization; Performance; Performance Analysis and Design Aids simulation; Processors compilers; Temporal profiling; Working set optimization

Indexed keywords

EID: 0005329615     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/330249.330254     Document Type: Article

References (36)

1. AMMONS, G., BALL, T., AND LARUS, J. 1997. Exploiting hardware performance counters with flow and context sensitive profiling. In Proceedings of ACM SIGPLAN '97 Conference on Programming Language Design and Implementation. ACM, New York, 85-96.
2. BALL, T. AND LARUS, J. 1996. Efficient path profiling. In Proceedings of the 29th Annual ACM/IEEE International Symposium on Microarchitecture. IEEE, Los Alamitos, California, 46-57.
3. BERSHAD, B., CHEN, J. B., LEE, D., AND ROMER, T. 1994. Avoiding conflict misses dynamically in large direct-mapped caches. In Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems. ACM, New York, 158-170.
4. BLACKWELL, T. 1998. Applications of randomness in system performance measurement. Ph.D. thesis, Harvard University, Cambridge, Massachusetts.
5. CALDER, B. AND GRUNWALD, D. 1994. Reducing branch costs via branch alignment. In Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems. ACM, New York, 242-251.
6. CALDER, B., KRINTZ, C., JOHN, S., AND AUSTIN, T. 1998. Cache-conscious data placement. In Proceedings of the Eighth International Conference on Architectural Support for Programming Languages and Operating Systems. ACM, New York, 139-149.
7. CARR, S., MCKINLEY, K., AND TSENG, C. 1994. Compiler optimizations for improving data locality. In Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems. ACM, New York, 252-262.
8. CHEN, J. B. AND LEUPEN, B. 1997. Improving instruction locality with just-in-time code layout. In Proceedings of the USENIX Windows NT Workshop. USENIX, Berkeley, California, 25-32.
9. COHN, R., AND LOWNEY, G. 1996. Hot cold optimization of large Windows NT applications. In Proceedings of the 29th Annual ACM/IEEE International Symposium on Microarchitecture. IEEE, Los Alamitos, California, 80-89.
10. CVETANOVIC, Z. AND DONALDSON, D. 1996. AlphaServer 4100 performance characterization. Digital Technical Journal 8, 4, 3-20.
11. CYTRON, R. AND LOEWNER, P. 1986. An automatic overlay generator. IBM Journal of Research and Development 30, 6 (Nov.), 603.
12. DENNING, P. 1970. Virtual memory. Computing Surveys 2, 3 (Sept.), 153-189.
13. FERRARI, D. 1974. Improving locality by critical working sets. Commun. ACM 17, 11 (Nov.), 614-620.
14. FERRARI, D. 1975. Tailoring programs to models of program behavior. IBM Journal of Research and Development 19, 244.
15. GLOY, N., BLACKWELL, T., SMITH, M. D., AND CALDER, B. 1997. Procedure placement using temporal ordering information. In Proceedings of the 30th Annual ACM/IEEE International Symposium on Microarchitecture. IEEE, Los Alamitos, California, 303-313.
16. HASHEMI, A., KAELI, D., AND CALDER, B. 1997. Efficient procedure mapping using cache line coloring. In Proceedings of the ACM SIGPLAN '97 Conference on Programming Language Design and Implementation. ACM, New York, 171-182.
17. HATFIELD, D. AND GERALD, J. 1971. Program restructuring for virtual memory. IBM Systems Journal 10, 3, 168-192.
18. HILL, M. D. 1988. A case for direct-mapped caches. Computer 21, 12 (Dec.), 25-40.
19. HWU, W. AND CHANG, P. 1989. Achieving high instruction cache performance with an optimizing compiler. In Proceedings of the 16th Annual International Symposium on Computer Architecture. IEEE, Washington, D.C., 242-251.
20. JOSEPH, D. AND GRUNWALD, M. 1997. Prefetching using Markov predictors. In Proceedings of the 24th Annual International Symposium on Computer Architecture. ACM, New York, 252-263.
21. KALAMATIANOS, J. AND KAELI, D. 1998. Temporal-based procedure reordering for improved instruction cache performance. In Proceedings of the 4th IEEE Symposium on High-Performance Computer Architecture. IEEE, New York, 244-253.
22. KAWAF, T., SHAKSHOBER, D. J., AND STANLEY, D. 1996. Performance analysis using very large memory on the 64-bit AlphaServer system. Digital Technical Journal 8, 3, 58-65.
23. LUK, C.-K. AND MOWRY, T. 1998. Cooperative prefetching: Compiler and hardware support for effective instruction prefetching in modern processors. In Proceedings of the 31st Annual ACM/IEEE International Symposium on Microarchitecture. IEEE, Los Alamitos, California, 182-193.
24. MCFARLING, S. 1989. Program optimization for instruction caches. In Proceedings of the Third International Conference on Architectural Support for Programming Languages and Operating Systems. ACM, New York, 183-191.
25. PETTIS, K. AND HANSEN, R. 1990. Profile-guided code positioning. In Proceedings of the ACM SIGPLAN '90 Conference on Programming Language Design and Implementation. ACM, New York, 16-27.
26. PHALKE, V. AND GOPINATH, B. 1995. An inter-reference gap model for temporal locality in program behavior. In Proceedings of the ACM SIGMETRICS '95 International Conference on Measurement and Modeling of Computer Systems. ACM, New York, 291.
27. PIERCE, J. AND MUDGE, T. 1996. Wrong-path prefetching. In Proceedings of the 29th Annual ACM/IEEE International Symposium on Microarchitecture. IEEE, Los Alamitos, California, 165-175.
28. QUONG, R. 1994. Expected I-cache miss rates via the gap model. In Proceedings of the 21st Annual International Symposium on Computer Architecture. IEEE, Los Alamitos, California, 372-383.
29. RYDER, K. 1974. Optimizing program placement in virtual systems. IBM Systems Journal 13, 292.
30. SMITH, A. 1982. Cache memories. Computing Surveys 14, 3 (Sept.), 473-530.
31. SMITH, J. AND Hsu, W.-C. 1992. Prefetching in supercomputer instruction caches. Supercomputing, 588.
32. SMITH, M. D. 1996. Extending SUIF for machine-dependent optimizations. In Proceedings of the First SUIF Compiler Workshop. Stanford University, Stanford, California, 14-25.
33. SRIVASTAVA, A. AND EUSTACE, A. 1994. ATOM: a system for building customized program analysis tools. In Proceedings of the ACM SIGPLAN '94 Conference on Programming Language Design and Implementation. ACM, New York, 196-205.
34. TORELLAS, J., XIA, C., AND DAIGLE, R. 1995. Optimizing instruction cache performance for operating system intensive workloads. In Proceedings of the First IEEE Symposium on High-Performance Computer Architecture. IEEE, Los Alamitos, California, 360-369.
35. YOUNG, C., JOHNSON, D., KARGER, D., AND SMITH, M. D. 1997. Near-optimal intraprocedural branch alignment. In Proceedings of the ACM SIGPLAN '97 Conference on Programming Language Design and Implementation. ACM, New York, 183-193.
36. YOUNG, C. AND SMITH, M. D. 1998. Better global scheduling using path profiles. In Proceedings of the 31st Annual ACM/IEEE International Symposium on Microarchitecture. IEEE, Los Alamitos, California, 115-123.