Extended whole program paths

Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT

Volumn 2005, Issue , 2005, Pages 17-26

  Tallam, Sriraman ^a   Gupta, Rajiv ^a   Zhang, Xiangyu ^a  

^a University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL FLOW; EXTENDED WHOLE PROGRAM PATH (EWPP); PROGRAM EXECUTION;

COMPUTATIONAL COMPLEXITY; DATA REDUCTION; FLOW CONTROL; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS;

MOTION PLANNING;

EID: 33746672527     PISSN: 1089795X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PACT.2005.22     Document Type: Conference Paper

References (21)

1. H. Agrawal and J. Horgan, "Dynamic Program Slicing," ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 246-256, 1990.
2. H. Agrawal, R. DeMillo, and E. Spafford, "Debugging with Dynamic Slicing and Backtracking," Software Practice and Experience, 23(6):589-616, 1993.
3. G. Ammons and J.R. Larus, "Improving Data Flow Analysis with Path Profiles," ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 72-84, Montreal, Canada, 1998.
4. T. Ball and J.R. Larus, "Efficient Path Profiling," IEEE/ACM International Symposium on Microarchitecture, 1996.
5. R. Bodik, R. Gupta and M.L. Soffa, "Complete Removal of Redundant Expressions," ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 1-14, Montreal, Canada, June 1998.
6. M. Burtscher, "VPC3: A Fast and Effective Trace-Compression Algorithm," Joint International. Conference on Measurement and Modeling of Computer Systems (SIGMET-RICS), pages 167-176, June 2004.
7. R. Gupta, D. Berson, and J.Z. Fang, "Path Profile Guided Partial Redundancy Elimination Using Speculation," IEEE International Conference on Computer Languages, pages 230-239, Chicago, Illinois, May 1998.
8. Q. Jacobson, E. Rotenberg, and J.E. Smith, "Path-Based Next Trace Prediction," The 30th IEEE/ACM International Symposium on Microarchitecture, December 1997.
9. B. Korel and J. Laski, "Dynamic Program Slicing," Information Processing Letters, 29(3):155-163, 1988.
10. B. Korel and J. Rilling, "Application of Dynamic Slicing in Program Debugging," AADEBUG, pages 43-58, 1997.
11. M. Kamkar, "Interprocedural Dynamic Slicing with Applications to Debugging and Testing," PhD Thesis, Linkoping University, 1993.
12. J.R. Larus, "Whole Program Paths," ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 259-269, Atlanta, GA, May 1999.
13. S-W. Liao, P.H. Wang, H. Wang, J.R Shen, G. Hoflehner, and D.M. Lavery, "Post-Pass Binary Adaptation for Software-Based Speculative Precomputation," ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 117-128, 2002.
14. J. Lin, T. Chen, W-C. Hsu, P-C. Yew, R.D-C. Ju, T-F. Ngai, S. Chan, "A Compiler Framework for Speculative Analysis and Optimizations," ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 289-299, 2003.
15. J. Lin, W-C. Hsu, P-C. Yew, R. Ju, and T-F. Ngai, "A Compiler Framework for Recovery Code Generation in General Speculative Optimizations," PACT, pages 17-28, 2004.
16. C.G. Nevil-Manning and I.H. Witten, "Linear-time, Incremental Hierarchy Inference for Compression," Data Compression Conference, Snowbird, Utah, IEEE Computer Society, pages 3-11, 1997.
17. Y. Sazeides, "Instruction-Isomorphism in Program Execution," Value Prediction Workshop, June 2003.
18. C. Young and M.D. Smith, "Better Global Scheduling Using Path Profiles," IEEE/ACM International Symposium on Microarchitecture, pages 115-123, 1998.
19. X. Zhang and R. Gupta, "Cost Effective Dynamic Program Slicing," ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 94-106, Washington D.C., June 2004.
20. Y. Zhang and R. Gupta, "Timestamped Whole Program Path Representation and its Applications," ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 180-190, Snowbird, June 2001.
21. C.B. Zilles and G. Sohi, "Understanding the Backward Slices of Performance Degrading Instructions," 27th International Symposium on Computer Architecture, 2000.