• DocumentCode
    2194343
  • Title

    Trace preconstruction

  • Author

    Jacobson, Qui N n ; Smith, James E.

  • Author_Institution
    Sun Microsyst., Palo Alto, CA, USA
  • fYear
    2000
  • fDate
    14-14 June 2000
  • Firstpage
    37
  • Lastpage
    46
  • Abstract
    Trace caches enable high bandwidth, low latency instruction supply, but have a high miss penalty and relatively large working sets. Consequently, their performance may suffer due to capacity and compulsory misses. Trace preconstruction augments a trace cache by performing a function analogous to prefetching. The trace preconstruction mechanism observes the processor´s instruction dispatch stream to detect opportunities for jumping ahead of the processor. After doing so, the preconstruction mechanism fetches static instructions from the predicted future region of the program, and constructs a set of traces in advance of when they are needed. Trace preconstruction can significantly increase both the performance of the trace cache and the robustness of the trace cache to varying workloads. All but one of the SPECint95 benchmarks see a notable reduction in trace cache miss rates from preconstruction. The three benchmarks that have the largest working set (gcc, go and vortex) see a 30% to 80% reduction in trace cache misses. We also consider the integration of preconstruction with another trace-specific mechanism (preprocessing) to produce a high performance frontend. When combined, preconstruction and trace preprocessing produce an average speedup of 14% for the SPECint95 benchmarks.
  • Keywords
    cache storage; benchmarks; trace cache; trace preconstruction; workloads;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Architecture, 2000. Proceedings of the 27th International Symposium on
  • Conference_Location
    Vancouver, BC, Canada
  • ISSN
    1063-6897
  • Print_ISBN
    1-58113-232-8
  • Type

    conf

  • Filename
    854376