This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Lossless Trace Compression
February 2001 (vol. 50 no. 2)
pp. 158-173

Abstract—The tremendous storage space required for a useful data base of program traces has prompted a search for trace reduction techniques. In this paper, we discuss a range of information-lossless address and instruction trace compression schemes that can reduce both storage space and access time by an order of magnitude or more, without discarding either references or interreference timing information from the original trace. The PDATS family of trace compression techniques achieves trace coding densities of about six references per byte. This family of techniques is now in use as the standard in the NMSU TraceBase, an extensive trace archive that has been established for use by the international research and teaching community.

[1] M.D. Hill, “DineroIII Documentation, Unpublished Unix-Style Man Page,” Univ. of California, Berkeley, Oct. 1985.
[2] A.J. Smith, “Two Methods for the Efficient Analysis of Memory Address Trace Data,” IEEE Trans. Software Eng., vol. 3, no. 1, 1977.
[3] T.R. Puzak, “Analysis of Cache Replacement Algorithms,” PhD dissertation, Univ. of Massachusetts, 1985.
[4] A. Agarwal and M. Huffman, “Blocking: Exploiting Spatial Locality for Trace Compaction,” Proc. ACM SIGMETRICS, 1990.
[5] E.E. Johnson and C.D. Schieber, “RATCHET: Real-Time Address Trace Compression Hardware for Extended Traces,” Performance Evaluation Review, vol. 21, nos. 3-4, pp. 22-32, Apr. 1994.
[6] S. Das and E.E. Johnson, “Accuracy of Filtered Traces,” Proc. IEEE Int'l Phoenix Conf. Computers and Comm., pp. 82-86, Apr. 1995.
[7] J.W.C. Fu and J.H. Patel, “Trace Driven Simulation Using Sampled Traces,” Proc. 27th Ann. Hawaii Int'l Conf. System Sciences, pp. 211-220, 1994.
[8] A.D. Samples, “Mache: No-Loss Trace Compaction,” Proc. ACM SIGMETRICS 1989, pp. 89-97, 1989.
[9] E.E. Johnson and J. Ha, “PDATS: Lossless Address Trace Compression for Reducing File Size and Access Time,” Proc. IEEE Int'l Phoenix Conf. Computers and Comm., pp. 213-219, May 1994.
[10] J.L. Hennessy and D.A. Patterson, Computer Architecture: A Quantitative Approach, Morgan Kaufmann, San Mateo, Calif., 1990.
[11] J. Rothstein,“Bus Automata, Brains, and Mental Models,” IEEE Trans. on Systems, Man, and Cybernetics, vol. 18, no. 4, pp. 522-531, Apr. 1988.
[12] J. Ziv and A. Lempel, “A Universal Algorithm for Sequential Data Compression,” IEEE Trans. Information Theory, vol. 23, no. 3, May 1987.
[13] T.A. Welch, “A Technique for High-Performance Data Compression,” Computer, vol. 17, no. 6, pp. 8-19, June 1984.

Index Terms:
Trace reduction, trace compression, lossless coding, trace-driven simulation.
Citation:
Eric E. Johnson, Jiheng Ha, M. Baqar Zaidi, "Lossless Trace Compression," IEEE Transactions on Computers, vol. 50, no. 2, pp. 158-173, Feb. 2001, doi:10.1109/12.908991
Usage of this product signifies your acceptance of the Terms of Use.