• DocumentCode
    748047
  • Title

    Two Methods for the Efficient Analysis of Memory Address Trace Data

  • Author

    Smith, Alan Jay

  • Author_Institution
    Computer Science Division, Department of Electrical Engineering and Computer Sciences, University of California
  • Issue
    1
  • fYear
    1977
  • Firstpage
    94
  • Lastpage
    101
  • Abstract
    The high cost of analyzing long memory address traces has limited most researchers to short traces and analysis algorithms that are linear in the length of the trace. We suggest two methods that permit a trace to be shortened in length by one to two orders of magnitude (or more) for later further analysis. The Stack Deletion Method eliminates all references in the trace to the top k levels of the LRU stack. The Snapshot Method records the reference bits of the pages in the original tape at discrete intervals and uses these bits to generate a new trace. Extensive measurements are presented, from which we conclude that there is little or no loss in accuracy using reduced traces for many purposes for a wide range of memory sizes and degrees of reduction.
  • Keywords
    Data compression; memory management; paging; trace driven simulation; Algorithm design and analysis; Clocks; Computational modeling; Computer simulation; Costs; Loss measurement; Memory management; Processor scheduling; Scheduling algorithm; Size measurement; Data compression; memory management; paging; trace driven simulation;
  • fLanguage
    English
  • Journal_Title
    Software Engineering, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-5589
  • Type

    jour

  • DOI
    10.1109/TSE.1977.233841
  • Filename
    1702406