Compact Trace Trees in Dynamic Binary Translators

  • Porto J
  • Araujo G
  • Wu Y
 et al. 
  • 6

    Readers

    Mendeley users who have this article in their library.
  • N/A

    Citations

    Citations of this article.

Abstract

Trace Tree (TT) is a technique to collect program execution traces, which is commonly used in JIT environments. Its main features are the ability to perform loop unrolling and function inlining at no cost, while detecting application loop kernels. In this paper we evaluate a TT implementation in a DBT environment. We show that, under DBT, trace trees suffer from severe code duplication, considerably degrading its performance. In order to take advantage of the TTs interesting features in DBTs, we propose a variation called Compact Trace Trees (CTTs), which we show to be faster and to reduce code duplication.

Author-supplied keywords

  • compact trace trees
  • dbt
  • hot spots
  • trace trees

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

There are no full text links

Authors

  • João Paulo Porto

  • Guido Araujo

  • Youfeng Wu

  • Edson Borin

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free