{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T18:18:36Z","timestamp":1761675516803,"version":"3.41.0"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T00:00:00Z","timestamp":1188604800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2007,9]]},"abstract":"<jats:p>\n            We describe the design, generation, and compression of the\n            <jats:italic>extended whole program path<\/jats:italic>\n            (eWPP), representation that not only captures the control flow history of a program execution but also its data dependence history. This representation is motivated by the observation that, typically, a significant fraction of data dependence history can be recovered from the control flow trace. To capture the remainder of the data dependence history, we introduce\n            <jats:italic>disambiguation checks<\/jats:italic>\n            in the program whose control flow signatures capture the results of the checks. The resulting extended control flow trace enables the recovery of otherwise irrecoverable data dependences. The code for the checks is designed to minimize the increase in program execution time and the extended control flow trace size when compared to directly collecting control flow and address traces. Our experiments show that compressed eWPPs are only one-quarter of the size of combined compressed control flow and address traces. However, their collection incurs a 5\u00d7 increase in runtime overhead relative to the overhead required for directly collecting the control flow and address traces, respectively.\n          <\/jats:p>","DOI":"10.1145\/1275937.1275943","type":"journal-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T13:44:55Z","timestamp":1189777495000},"page":"19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Unified control flow and data dependence traces"],"prefix":"10.1145","volume":"4","author":[{"given":"Sriraman","family":"Tallam","sequence":"first","affiliation":[{"name":"University of Arizona, Tuscon, Arizona"}]},{"given":"Rajiv","family":"Gupta","sequence":"additional","affiliation":[{"name":"University of California, Riverside, California"}]}],"member":"320","published-online":{"date-parts":[[2007,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/93542.93576"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380230603"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/277650.277665"},{"volume-title":"Proceedings of the IEEE\/ACM International Symposium on Microarchitecture. IEEE\/ACM","author":"Ball T.","key":"e_1_2_1_4_1","unstructured":"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. 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."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/277650.277653"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005686.1005708"},{"volume-title":"Proceedings of the 12th International Conference on Parallel Architectures and Compilation Techniques. IEEE","author":"Burtscher M.","key":"e_1_2_1_7_1","unstructured":"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. 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."},{"volume-title":"Proceedings of the 13th International Conference on Compiler Construction. 57--72","author":"Chen T.","key":"e_1_2_1_8_1","unstructured":"Chen , T. , Lin , J. , Dai , X. , Hsu , W.-C. , and Yew , P . -C. 2004. Data Dependence Profiling for Speculative Optimization . In Proceedings of the 13th International Conference on Compiler Construction. 57--72 . Chen, T., Lin, J., Dai, X., Hsu, W.-C., and Yew, P.-C. 2004. Data Dependence Profiling for Speculative Optimization. In Proceedings of the 13th International Conference on Compiler Construction. 57--72."},{"volume-title":"Proceedings of the IEEE International Conference on Computer Languages. IEEE","author":"Gupta R.","key":"e_1_2_1_9_1","unstructured":"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. 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."},{"volume-title":"Proceedings of the 30th IEEE\/ACM International Symposium on Microarchitecture. IEEE\/ACM","author":"Jacobson Q.","key":"e_1_2_1_10_1","unstructured":"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. 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."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90054-3"},{"volume-title":"Proceedings of the Automated and Algorithmic Debugging. 43--59","author":"Korel B.","key":"e_1_2_1_13_1","unstructured":"Korel , B. and Rilling , J . 1997. Application of dynamic slicing in program debugging . In Proceedings of the Automated and Algorithmic Debugging. 43--59 . Korel, B. and Rilling, J. 1997. Application of dynamic slicing in program debugging. In Proceedings of the Automated and Algorithmic Debugging. 43--59."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/301618.301678"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512544"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/781131.781164"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1025127.1025993"},{"volume-title":"Proceedings of the Data Compression Conference. IEEE-CS","author":"Nevil-Manning C.G.","key":"e_1_2_1_18_1","unstructured":"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. 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."},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the Value Prediction Workshop.","author":"Sazeides Y.","year":"2003","unstructured":"Sazeides , Y. 2003 . Instruction-isomorphism in program execution . In Proceedings of the Value Prediction Workshop. Sazeides, Y. 2003. Instruction-isomorphism in program execution. In Proceedings of the Value Prediction Workshop."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2005.22"},{"key":"e_1_2_1_21_1","first-page":"352","article-title":"Program slicing","volume":"4","author":"Weiser M.","year":"1982","unstructured":"Weiser , M. 1982 . Program slicing . IEEE Transactions on Software Engineering SE-10 , 4 , 352 -- 357 . Weiser, M. 1982. Program slicing. IEEE Transactions on Software Engineering SE-10, 4, 352--357.","journal-title":"IEEE Transactions on Software Engineering SE-10"},{"volume-title":"Proceedings of the IEEE\/ACM International Symposium on Microarchitecture. IEEE\/ACM","author":"Young C.","key":"e_1_2_1_22_1","unstructured":"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. 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."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/996841.996855"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1085130.1085135"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134002"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378835"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1152154.1152180"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/339647.339676"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1275937.1275943","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1275937.1275943","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:58:00Z","timestamp":1750258680000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1275937.1275943"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["10.1145\/1275937.1275943"],"URL":"https:\/\/doi.org\/10.1145\/1275937.1275943","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"type":"print","value":"1544-3566"},{"type":"electronic","value":"1544-3973"}],"subject":[],"published":{"date-parts":[[2007,9]]},"assertion":[{"value":"2007-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}