z-logo
open-access-imgOpen Access
Extended whole program paths
Author(s) -
S. Tallam,
R. Gupta,
Xiangyu Zhang
Publication year - 2005
Publication title -
14th international conference on parallel architectures and compilation techniques (pact'05)
Language(s) - English
Resource type - Conference proceedings
ISSN - 1089-795X
ISBN - 0-7695-2429-X
DOI - 10.1109/pact.2005.22
Subject(s) - computing and processing , communication, networking and broadcast technologies
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 flow trace size when compared to directly collecting control flow and dependence traces. Our experiments show that compressed eWPPs are only 4% of the size of combined compressed control flow and dependence traces and their collection requires 20% more runtime overhead than overhead required for directly collecting the control flow and dependence traces.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom