Goal-directed value Profiling

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

Volumn 2027, Issue , 2001, Pages 319-333

  Watterson, Scott ^a   Debray, Saumya ^a  

^a University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CODE SPECIALIZATION; CONSTANT FOLDING; CONSTANT VALUES; GOAL DIRECTED; OPTIMIZERS; PROGRAM POINTS; RUNTIME DISTRIBUTIONS; SPACE REQUIREMENTS;

PROGRAM COMPILERS;

EID: 80053318427     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45306-7_22     Document Type: Conference Paper

References (19)

1. J. Auslander, M Philipose, C. Chambers, S. Eggers, and B. Bershad. Fast, effectvie dynamic compilation. In SIGPLAN ’96 Conference on Programming Language Design and Implementation, pages 149–159, May 1996.
2. T. Ball and J. R. Larus, “Optimally Profiling and Tracing Programs”, Proc. 19th. Symposium on Principles of Programming Languages, Jan. 1992.
3. T. Ball and J. R. Larus, “Efficient Path Profiling”, Proc. MICRO-29, Dec. 1996.
4. B. Calder, P. Feller, and A. Eustace. Value profiling. In 30th Annual International Symposium on Microarchitecture, pages 259–269, December 1997.
5. B. Calder, P. Feller, andA. Eustace.Value profiling and optimization. In Journal of Instruction Level Parallelism, 1999.
6. P. P. Chang, S. A. Mahlke, W. Y. Chen, and W. W. Hwu, “Profile-guided automatic inline expansion for C programs”, Software Practice and Experience vol. 22 no. 5, May 1992, pp. 349–369.
7. R. Cohn and P. G. Lowney, “Hot Cold Optimization of Large Windows/NT Applications”, Proc. MICRO29, Dec. 1996.
8. C. Consel and F. Noel. A general approach to run-time specialization and its application to c. In 23rd Annual ACM Symposium on Principles of Programming Languages, pages 145–146, Jan 1996.
9. D. Engler, W. Hsieh, and M. Kaashoek. ‘c:A language for high-level, efficient, and machineindependent dynamic code generation. In 23rd Annual ACM Symposium on Principles of Programming Languages, pages 131–144, Jan 1996.
10. P. Feller. Value profling for instructions and memory locations. Master’s thesis, UCSD, 1998.
11. C. Fu, M. Jennings, S. Larin, and T. Conte. Software-only value speculation scheduling. Technical report, Department of Electrical and Computer Engineering, North Carolina State University, June 1998.
12. F. Gabbay and A. Mendelson. Can program profiling support value prediction? In Proceedings of the 30 th Annual ACM/IEEE International Symposium on Microarchitecture, pages 270–280, Dec 1997.
13. A. J. Goldberg, “ReducingOverhead in Counter-Based Execution Profiling”,Technical Report CSL-TR-91-495, Computer Systems Lab., Stanford University, Oct. 1991.
14. S. S. Muchnick, Advanced Compiler Design and Implementation, Morgan Kaufman, 1997.
15. Robert Muth, Scott Watterson, and Saumya Debray. Code specialization using value profiles. In Static Analysis Symposium, July 2000, pp. 340-359.
16. R. Muth, S. K. Debray, S. Watterson, and K. De Bosschere, “alto:ALink-Time Optimizer for the Compaq Alpha”, Software—Practice and Experience, vol. 31 no. 1, Jan 2001, pp. 67-101.
17. K. Pettis and R. C. Hansen, “Profile-Guided Code Positioning”, Proc. SIGPLAN ’90 Conference on Programming Language Design and Implementation, June 1990, pp. 16–27.
18. B. Calder and D. Grunwald, “Reducing Indirect Function Call Overhead in C++ Programs”, Proc. 21st ACM Symposium on Principles of Programming Languages, Jan. 1994, pp. 397–408.
19. U. Hölzle and D. Ungar, “Optimizing Dynamically-Dispatched Calls with Run-Time Type Feedback”, Proc. SIGPLAN ’94 Conference on Programming Language Design and Implementation (PLDI), June 1994, pp. 326–336.