direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments


Static Prediction of Recursion Frequency Using Machine Learning to Enable Hot Spot Optimizations
Zitatschlüssel tetzlaff12ESTIMedia
Autor Dirk Tetzlaff and Sabine Glesner
Seiten 42-51
Jahr 2012
ISBN 978-1-4673-4968-0
DOI 10.1109/ESTIMedia.2012.6507027
Ort Tampere, Finland
Journal Proceedings of the 10th IEEE Symposium on Embedded Systems for Real-time Multimedia (ESTIMedia)
Herausgeber IEEE Computer Society
Zusammenfassung Recursion poses a severe problem for static optimizations because its execution frequency usually depends upon runtime values, hence being rarely predictable at compile time. As a consequence, optimization potential of programs is sacrificed since possible hot paths where most of the execution time is spent and where optimization would be beneficial might be undiscovered. In this paper, we propose a sophisticated machine learning based approach to statically predict the recursion frequency of functions for programs in real-world application domains, which can be used to guide various hot spot optimizations. Our experiments with 369 programs of 25 benchmark suites from different domains demonstrate that our approach is applicable to a wide range of programs with different behavior and yields more precise heuristics than those generated by pure static analyses. Moreover, our results provide valuable insights into recursive structures in general, when they appear and how deep they are.
Link zur Originalpublikation [1] Download Bibtex Eintrag [2]
------ Links: ------

Zusatzinformationen / Extras


Schnellnavigation zur Seite über Nummerneingabe

Copyright TU Berlin 2008