• DocumentCode
    2165339
  • Title

    Compressing extended program traces using value predictors

  • Author

    Burtscher, Martin ; Jeeradit, Metha

  • Author_Institution
    Comput. Syst. Lab., Cornell Univ., Ithaca, NY, USA
  • fYear
    2003
  • fDate
    27 Sept.-1 Oct. 2003
  • Firstpage
    159
  • Lastpage
    169
  • Abstract
    Trace files record the execution behavior of programs for future analysis. Unfortunately, nontrivial program traces tend to be very large and have to be compressed. While good compression schemes exist for traces that capture only the PCs of the executed instructions, these schemes can be ineffective on extended traces that include important additional information such as register values or effective addresses. Our novel, value-prediction-based approach compresses extended traces up to 22.8 times better and about two and a half times as well on average. In addition to the higher compression rate, our lossless single-pass algorithm has a fixed memory requirement and compresses traces faster than other algorithms. It achieves compression rates of up to 6170. We describe the design of our compression method and illustrate how value predictors can be used to effectively compress extended program traces.
  • Keywords
    data compression; multiprocessing systems; program compilers; program diagnostics; storage management; extended program traces compression; lossless single-pass algorithm; trace file; value-prediction-based approach; Accuracy; Boosting; Encoding; Hard disks; Hardware; Laboratories; Microprocessors; Personal communication networks; Registers; Writing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Architectures and Compilation Techniques, 2003. PACT 2003. Proceedings. 12th International Conference on
  • ISSN
    1089-795X
  • Print_ISBN
    0-7695-2021-9
  • Type

    conf

  • DOI
    10.1109/PACT.2003.1238012
  • Filename
    1238012