Unified Control Flow and Data Dependence Traces

ACM Transactions on Architecture and Code Optimization

Volumn 4, Issue 3, 2007, Pages 19-

  Tallam, Sriraman ^a   Gupta, Rajiv ^b  

^a UNIVERSITY OF ARIZONA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

address trace; Algorithms; Control flow trace; dynamic data dependence trace; Measurement; Performance; profiling

Indexed keywords

EID: 53049097726     PISSN: 15443566     EISSN: 15443973     Source Type: Journal    
DOI: 10.1145/1275937.1275943     Document Type: Article

References (27)

1. Agrawal, H. and Horgan, J. 1990. Dynamic program slicing. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation., ACM, New York., 246-256. Agrawal, H., DeMillo, R., and Spafford, E. 1993. Debugging with dynamic slicing and backtracking. Software Practice and Experience 23, 6, 589-616.
2. Ammons, G. and Larus, J. R. 1998. Improving data flow analysis with path profiles. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation., ACM, New York., 72-84.
3. Ball, T and Larus, J. R. 1996. Efficient path profiling. In Proceedings of the IEEE/ACM International Symposium on Microarchitecture., IEEE/ACM, New York., 46-57.
4. Bodik, R., Gupta, R., and Soffa, M. L. 1998. Complete removal of redundant expressions. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York. 1-14.
5. Burtscher, M. 2004. VPC3: A fast and effective trace-compression algorithm. In Proceedings of the SIGMETRICS Conference. ACM, New York. 167-176.
6. Burtscher, M. and Jeeradit, M. 2003. Compressing extended program traces using value predictors. In Proceedings of the 12th International Conference on Parallel Architectures and Compilation Techniques., IEEE, Los Alamitos, CA., 159-169.
7. Chen, T., Lin, J., Dai, X., Hsu, W.-C., and Yew, P.-C. 2004. Data Dependence Profiling for Speculative Optimization. In Proceedings of the 13 th International Conference on Compiler Construction. 57-72.
8. Gupta, R., Berson, D., and Fang, J. Z. 1998. Path profile guided partial redundancy elimination using speculation. In Proceedings of the IEEE International Conference on Computer Languages. IEEE, Los Alamitos, CA. 230-239.
9. Jacobson, Q., Rotenberg, E., and Smith, J. E. 1997. Path-based next trace prediction. In Proceedings of the 30th IEEE/ACM International Symposium on Microarchitecture., IEEE/ACM, New York., 14-23.
10. Kamkar, M. 1993. Interprocedural dynamic slicing with applications to debugging and testing. PhD Thesis, Linkoping University, Sweden.
11. Korel, B. and Laski, J. 1988. Dynamic program slicing. Information Processing Letters 29, 3, 155-163.
12. Korel, B. and Rilling, J. 1997. Application of dynamic slicing in program debugging. In Proceedings of the Automated and Algorithmic Debugging. 43-59.
13. Larus, J. R. 1999. Whole program paths. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation., ACM, New York., 259-269.
14. Liao, S. W., Wang, P. H., Wang, H., Shen, J. P., Hoflehner, G., Lavery, D. M., and Zhang, X. 2002. Post-Pass Binary Adaptation for Software Speculative Precomputation. In ACM SIGPLAN Conference on Programming Language Design and Implementation. 117-128.
15. Lin, J., Chen, T., Hsu, W. C., Yew, P. C., Ju, R. D. C., Ngai, T. F., and Chan, S. 2003. A Compiler Framework for Speculative Analysis and Optimizations. In ACM SIGPLAN Conference on Programming Language Design and Implementation. 289-299.
16. LIN, J., HSU, W. C., YEW, P. C., JU, R. D. C., NGAI, T. F. 2004. A Compiler Framework for Recovery Code Generation in General Speculative Optimizations. In 14th International Conference on Parallel Architectures and Compilation Techniques. 17-28.
17. Nevil-Manning, C. G. and Witten, I. H. 1997. Linear-time, incremental hierarchy inference for compression. In Proceedings of the Data Compression Conference., IEEE-CS, Los Alamitos, CA., 3-11.
18. Sazeides, Y. 2003. Instruction-isomorphism in program execution. In Proceedings of the Value Prediction Workshop.
19. Tallam, S., Gupta, R., and Zhang, X. 2005. Extended Whole Program Paths. In 14th International Conference on Parallel Architectures and Compilation Techniques. 17-26.
20. Weiser, M. 1982. Program slicing. IEEE Transactions on Software Engineering SE-10 352-357.
21. Young, C. and Smith, M. D. 1998. Better global scheduling using path profiles. In Proceedings of the IEEE/ACM International Symposium on Microarchitecture., IEEE/ACM, New York., 115-123.
22. Zhang, X. and Gupta, R. 2004. Cost effective dynamic program slicing. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation., ACM, New York., 94-106.
23. Zhang, X., He, H., Gupta, N. and Gupta, R. 2005. Experimental Evaluation of using Dynamic Slices for Fault Location. In SIGSOFT-SIGPLAN Sixth International Symposium on Automated and Analysis-Driven Debugging., ACM, New York., 33-42.
24. Zhang, X., Gupta, N. and Gupta, R. 2006. Pruning Dynamic Slices with Confidence. In ACM SIGPLAN Conference on Programming Language Design and Implementation., ACM, New York., 169-180.
25. Zhang, Y. and Gupta, R. 2001. Timestamped whole program path representation and its applications. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation., ACM, New York., 180-190.
26. Zhao, Q., Sim, J. E., Wong, W. F., and Rudolph, L. 2006. DEP: detailed execution profile. In 15th International Conference on Parallel Architectures and Compilation Techniques. 154-163.
27. Zilles, C. B. and Sohi, G. 2000. Understanding the backward slices of performance degrading instructions. In Proceedings of the IEEE/ACM 27th International Symposium on Computer Architecture., IEEE/ACM, New York., 172-181.