|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2009 International Symposium on Code Generation and Optimization
Profiling k-Iteration Paths : A Generalization of the Ball-Larus Profiling Algorithm
Seattle, Washington
March 22-March 25
ISBN: 978-0-7695-3576-0
| ASCII Text | x | ||
| Subhajit Roy, Y.N. Srikant, "Profiling k-Iteration Paths : A Generalization of the Ball-Larus Profiling Algorithm," Proceedings of the 2013 IEEE/ACM International Symposium on Code Generation and Optimization (CGO), pp. 70-80, 2009 International Symposium on Code Generation and Optimization, 2009. | |||
| BibTex | x | ||
| @article{ 10.1109/CGO.2009.11, author = {Subhajit Roy and Y.N. Srikant}, title = {Profiling k-Iteration Paths : A Generalization of the Ball-Larus Profiling Algorithm}, journal ={Proceedings of the 2013 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)}, volume = {0}, year = {2009}, isbn = {978-0-7695-3576-0}, pages = {70-80}, doi = {http://doi.ieeecomputersociety.org/10.1109/CGO.2009.11}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Proceedings of the 2013 IEEE/ACM International Symposium on Code Generation and Optimization (CGO) TI - Profiling k-Iteration Paths : A Generalization of the Ball-Larus Profiling Algorithm SN - 978-0-7695-3576-0 SP70 EP80 A1 - Subhajit Roy, A1 - Y.N. Srikant, PY - 2009 VL - 0 JA - Proceedings of the 2013 IEEE/ACM International Symposium on Code Generation and Optimization (CGO) ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CGO.2009.11
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 such k-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.
Citation:
Subhajit Roy, Y.N. Srikant, "Profiling k-Iteration Paths : A Generalization of the Ball-Larus Profiling Algorithm," cgo, pp.70-80, 2009 International Symposium on Code Generation and Optimization, 2009
Usage of this product signifies your acceptance of the Terms of Use.