Extended Whole Program Paths

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 trace...

• Type: Conference
• Year: 2005
• Where: IEEEPACT
• Authors: Sriraman Tallam, Rajiv Gupta, Xiangyu Zhang
• Keywords: Control flow, Data Dependence History, Data Dependences, Hardware, IEEEPACT 2005