Profile-guided compiler optimizations

The Compiler Design Handbook: Optimizations and Machine Code Generation

Volumn , Issue , 2002, Pages 143-174

  Gupta, Rajiv ^a   Mehofer, Eduard ^b   Zhang, Youtao ^a  

^a UNIVERSITY OF ARIZONA   (United States)

^b UNIVERSITY OF VIENNA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84947744909     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781420040579     Document Type: Chapter

References (45)

1. A.-H.A. Badawy, A. Aggarwal, D. Yeung and C.-W. Tseng, Evaluating the Impact of Memory System Performance on Software Prefetching and Locality Optimizations, in 15th Annual ACM International Conference on Supercomputing (ICS), Sorrento, Italy, June 2001, pp. 486-500.
2. T. Ball and J.R. Larus, Efficient Path Profiling, in 29th IEEE/ACM International Symposium on Microarchitecture (MICRO), December 1996, pp. 46-57.
3. T. Ball, P. Mataga and M. Sagiv, Edge Profiling versus Path Profiling: The Showdown, in 25th ACM SIGPLAN-SIGACT Symposium on Principle of Programming Languages (POPL), San Diego, CA, January 1998, pp. 134-148.
4. R. Bodik, R. Gupta and M.L. Soffa, Interprocedural Conditional Branch Elimination, in ACM SIGPLAN Conference on Programming Language Design and Implementation, Las Vegas, NV, June 1997, pp. 146-158.
5. R. Bodik and R. Gupta, Partial Dead Code Elimination Using Slicing Transformations, in ACM SIGPLAN Conference on Programming Language Design and Implementation, Las Vegas, NV, June 1997, pp. 159-170.
6. R. Bodik, R. Gupta and M.L. Soffa, Complete Removal of Redundant Expressions, in ACM SIGPLAN Conference on Programming Language Design and Implementation, Montreal, Canada, June 1998, pp. 1-14.
7. R. Bodik, R. Gupta and M.L. Soffa, Load-Reuse Analysis: Design and Evaluation, in ACM SIGPLAN Conference on Programming Language Design and Implementation, Atlanta, GA, May 1999, pp. 64-76.
8. R. Bodik, R. Gupta and V. Sarkar, ABCD: Eliminating Array Bounds Checks on Demand, in ACM SIGPLAN Conference on Programming Language Design and Implementation, Vancouver, Canada, June 2000, pp. 321-333.
9. B. Calder, P. Feller and A. Eustace, Value Profiling, in 30th IEEE/ACM International Symposium on Microarchitecture (MICRO), December 1997, pp. 259-269.
10. B. Calder, C. Krintz, S. John and T. Austin, Cache-Conscious Data Placement, in 8th ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), San Jose, CA, October 1998, pp. 139-149.
11. T.M. Chilimbi, M.D. Hill and J.R. Larus, Cache-Conscious Structure Layout, in ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Atlanta, GA, May 1999, pp. 1-12.
12. T.M. Chilimbi, B. Davidson and J.R. Larus, Cache-Conscious Structure Definition, in ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Atlanta, GA, May 1999, pp. 13-24.
13. T.M. Chilimbi, Efficient Representations and Abstractions for Quantifying and Exploiting Data Reference Locality, in ACM SIGPLAN Conference on Programming Language Design and Implementation, Snowbird, UT, June 2001, pp. 191-202.
14. J. Davidson and S. Jinturkar, Memory Access Coalescing: A Technique for Eliminating Redundant Memory Accesses, in ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Orlando, FL, June 1994, pp. 186-195.
15. D.M. Dhamdhere, Practical adaptation of global optimization algorithm of Morel and Renvoise, ACM Trans. Programming Languages, 13(2), 291-294, 1991.
16. E. Duesterwald, R. Gupta and M.L. Soffa, A practical framework for demand-driven interprocedural data flowanalysis, ACMTrans. Programming Languages Syst., 19(6), 992-1030, November 1997.
17. E. Duesterwald, R. Gupta and M.L. Soffa, Demand-Driven Computation of Interprocedural Data Flow, in ACM SIGPLAN-SIGACT 22nd Symposium on Principles of Programming Languages (POPL), San Francisco, CA, January 1995, pp. 37-48.
18. C. Dulong, The IA-64 Architecture at Work, in IEEE Comput., 31(7), 24-32, July 1998.
19. R. Gupta, A Fresh Look at Optimizing Array Bound Checks, in ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), White Plains, NY, June 1990, pp. 272-282.
20. R. Gupta, D. Berson and J.Z. Fang, Path Profile Guided Partial Redundancy Elimination Using Speculation, in IEEE International Conference on Computer Languages (ICCL), Chicago, IL, May 1998, pp. 230-239.
21. R. Gupta, D. Berson and J.Z. Fang, Resource-Sensitive Profile-Directed Data Flow Analysis for Code Optimization, in IEEE/ACM 30th International Symposium on Microarchitecture (MICRO), Research Triangle Park, NC, December 1997, pp. 358-368.
22. R. Gupta, D. Berson and J.Z. Fang, Path Profile Guided Partial Dead Code Elimination Using Predication, in International Conference on Parallel Architectures and Compilation Techniques (PACT), San Francisco, CA, November 1997, pp. 102-115.
23. R.E. Hank, W.-M. Hwu and B.R. Rau, Region-based Compilation: An Introduction and Motivation, in 28th IEEE/ACMInternational Symposium on Microarchitecture (MICRO), Ann Arbor, MI, 1995, pp. 158-168.
24. N. Heintze and O. Tardieu, Demand-Driven Pointer Analysis, in ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Snowbird, UT, June 2001, pp. 24-34.
25. J. Knoop, O. Ruthing and B. Steffen, Lazy Code Motion, in ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), San Francisco, CA, June 1992, pp. 224-234.
26. J. Knoop, O. Ruthing and B. Steffen, Partial Dead Code Elimination, in ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Orlando, FL, June 1994, pp. 147-158.
27. J. Larus, Whole Program Paths, ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Atlanta, GA, May 1999, pp. 259-269.
28. C.-K. Luk and T.C. Mowry, Memory Forwarding: Enabling Aggressive Layout Optimizations by Guaranteeing the Safety of Data Relocation, in 26th IEEE/ACM International Symposium on Computer Architecture (ISCA), May 1999, pp. 88-99.
29. S. McFarling, Program Optimization for Instruction Caches, in 3rd ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), April 1989, pp. 183-191.
30. E. Mehofer and B. Scholz, A Novel Probabilistic Data Flow Framework, in 10th International Conference on Compiler Construction (CC), Genova, Italy, Lecture Notes in Computer Science, Vol. 2027, Springer-Verlag, April 2001, pp. 37-51.
31. C.G. Nevil-Manning and I.H. Witten, Linear-time, Incremental Hierarchy Inference for Compression, in Data Compression Conference, Snowbird, UT, IEEE Computer Society, 1997, pp. 3-11.
32. V. Sarkar, Determining Average Program Execution Times and Their Variance, in ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Portland, OR, June 1989, pp. 298-312.
33. M. Stephenson, J. Babb and S. Amarasinghe, Bitwidth Analysis with Application to Silicon Compilation, in ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Vancouver, Canada, June 2000, pp. 108-120.
34. D.N. Truong, F. Bodin and A. Seznec, Improving Cache Behavior of Dynamically Allocated Data Structures, in International Conference on Parallel Architectures and Compilation Techniques (PACT), Paris, France, 1998, pp. 322-329.
35. S. Watterson and S. Debray, Goal-Directed Value Profiling, in 10th International Conference on Compiler Construction (CC), LNCS Lecture Notes in Computer Sciences, Vol. 2027, Springer-Verlag, New York, 2001.
36. E. Morel and C. Renvoise, Global optimization by suppression of partial redundancies, Commun. ACM, 22(2), 96-103, 1979.
37. F. Mueller and D. Whalley, Avoiding Conditional Branches by Code Replication, in ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), La Jolla, CA, June 1995, pp. 56-66.
38. G. Ramalingam, Data Flow Frequency Analysis, in ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Philadelphia, PA, 1996, pp. 267-277.
39. T. Reps, S. Horwitz and M. Sagiv, Precise Interprocedural Dataflow Analysis Via Graph Reachability, in ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL), San Francisco, CA, January 1995, pp. 49-61.
40. B. Steffen, Property Oriented Expansion, in International Static Analysis Symposium (SAS), Germany, September 1996, Lecture Notes in Computer Science, Vol. 1145, Springer-Verlag, New York, 1996, pp. 22-41.
41. B. Steffen, Data Flow Analysis as Model Checking, TACS, Sendai, Japan, Lecture Notes in Computer Science, Vol. 526, Springer-Verlag, New York, 1991, pp. 346-364.
42. C. Young, D.S. Johnson, D.R. Karger and M.D. Smith, Near-optimal Intraprocedural Branch Alignment, in ACMSIGPLAN Conference on Programming Language Design and Implementation (PLDI), Las Vegas, NV, June 1997, pp. 183-193.
43. Y. Zhang and R. Gupta, Timestamped Whole Program Path Representation, in ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Snowbird, UT, June 2001, pp. 180-190.
44. Y. Zhang, J. Yang and R. Gupta, Frequent Value Locality and Value-Centric Data Cache Design, in 9th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), Cambridge, MA, November 2000, pp. 150-159.
45. Y. Zhang and R. Gupta, Data Compression Transformations for Dynamically Allocated Data Structures, in International Conference on Compiler Construction, Grenoble, France, April 2002.