The Community for Technology Leaders
Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques (2005)
St. Louis, Missouri
Sept. 17, 2005 to Sept. 21, 2005
ISSN: 1089-795X
ISBN: 0-7695-2429-X
pp: 17-26
Sriraman Tallam , The University of Arizona Department of Computer Science
Xiangyu Zhang , The University of Arizona Department of Computer Science
Rajiv Gupta , The University of Arizona Department of Computer Science
ABSTRACT
<p>We describe the design, generation and compression of the extended whole program path (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 disambiguation checks in the program whose control flow signatures capture the results of the checks. The resulting extended control flow trace enables the recovery of otherwise unrecoverable data dependences. The code for the checks is designed to minimize the increase in the program execution time and the extended control .ow trace size when compared to directly collecting control .ow and dependence traces. Our experiments show that compressed eWPPs are only 4% of the size of combined compressed control fow and dependence traces and their collection requires 20% more runtime overhead than overhead required for directly collecting the control flow and dependence traces.</p>
INDEX TERMS
null
CITATION
Sriraman Tallam, Xiangyu Zhang, Rajiv Gupta, "Extended Whole Program Paths", Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques, vol. 00, no. , pp. 17-26, 2005, doi:10.1109/PACT.2005.22
103 ms
(Ver 3.3 (11022016))