Loading...
Please wait, while we are loading the content...
Similar Documents
Extended whole program paths (2005)
| Content Provider | CiteSeerX |
|---|---|
| Author | Tallam, Sriraman Gupta, Rajiv Zhang, Xiangyu |
| Description | 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 of the size of combined compressed control flow and dependence traces and their collection requires more runtime overhead than overhead required for directly collecting the control flow and dependence traces. 1 In Proceedings of the 14th International Conference on Parallel Architectures and Compilation Techniques |
| File Format | |
| Language | English |
| Publisher Date | 2005-01-01 |
| Access Restriction | Open |
| Subject Keyword | Extended Whole Program Path Control Flow Trace Runtime Overhead Control Flow History Disambiguation Check Extended Control Flow Trace Data Dependence History Unrecoverable Data Dependence Program Execution Time Significant Fraction Control Flow Dependence Trace Extended Control Flow Trace Size Program Execution |
| Content Type | Text |
| Resource Type | Article |
