• DocumentCode
    3375134
  • Title

    Techniques for compressing program address traces

  • Author

    Pleszkun, Andrew R.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Colorado Univ., Boulder, CO, USA
  • fYear
    1994
  • fDate
    30 Nov.-2 Dec. 1994
  • Firstpage
    32
  • Lastpage
    39
  • Abstract
    A technique for generating consistent, reproducible traces with about an order of magnitude better compression than standard general-purpose compression programs is described. With this approach, the trace is read once, an intermediate form is generated and then read as the input to the second pass over the address stream. No program source code is required, and this technique will work on address streams that include OS calls. As a result of the way the address trace is encoded and processed, representing each reference requires only a fraction of a bit, between 0.00114 to 0.878 bits per reference. For example, the roughly 1.6 billion references generated by the xlisp benchmark from the SPEC92 suite can be stored using only about 48.6 million bytes. Depending on the benchmarks, more or less bits per references may be needed.
  • Keywords
    program compilers; system monitoring; SPEC92 suite; address streams; intermediate form; program address traces compression; xlisp benchmar; Analytical models; Computational modeling; Computer simulation; Distributed computing; Instruments; Machinery; Performance analysis; Permission; Random number generation; Sun;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Microarchitecture, 1994. MICRO-27. Proceedings of the 27th Annual International Symposium on
  • ISSN
    1072-4451
  • Print_ISBN
    0-89791-707-3
  • Type

    conf

  • DOI
    10.1109/MICRO.1994.717407
  • Filename
    717407