Roy, Subhajit and Srikant, YN (2009) Profiling k-Iteration Paths : A Generalization of the Ball-Larus Profiling Algorithm. In: 7th International Symposium on Code Generation and Optimization, MAR 22-25, 2009, Seattle, WA, pp. 70-80.
078.pdf - Published Version
Restricted to Registered users only
Download (363Kb) | Request a copy
The Ball-Larus path-profiling algorithm is an efficient technique to collect acyclic path frequencies of a program. However, longer paths -those extending across loop iterations - describe the runtime behaviour of programs better. We generalize the Ball-Larus profiling algorithm for profiling k-iteration paths - paths that can span up to to k iterations of a loop. We show that it is possible to number suchk-iteration paths perfectly, thus allowing for an efficient profiling algorithm for such longer paths. We also describe a scheme for mixed-mode profiling: profiling different parts of a procedure with different path lengths. Experimental results show that k-iteration profiling is realistic.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||12 Apr 2010 08:22|
|Last Modified:||19 Sep 2010 05:59|
Actions (login required)