Stream-based trace compression

IEEE Computer Architecture Letters

Volumn 2, Issue 1, 2003, Pages 4-

  Milenkovie, Aleksandar ^a   Milenkovie, Milena ^a  

^a UNIVERSITY OF ALABAMA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85008049341     PISSN: 15566056     EISSN: None     Source Type: Journal    
DOI: 10.1109/L-CA.2003.7     Document Type: Article

References (9)

1. M. Burtscher, M. Jeeradit, “Compressing Extended Program Traces Using Value Predictors,” in Proc. Int. Conf. on Parallel Architectures and Compilation Techniques (PACT), New Orleans, LA, 2003.
2. E. N. Elnozahy, “Address Trace Compression Through Loop Detection and Reduction,” ACM SIGMETRICS Performance Evaluation Review, v. 27 n. 1, p.214-215, June 1999.
3. E. E. Johnson, J. Ha, M. B. Zaidi, “Lossless Trace Compression,” IEEE Transactions on Computers, Vol. 50, No. 2, February 2001.
4. J. Larus, “Whole Program Paths,” in Proc. ACM SIGPLAN Conf on Programming Language Design and Implementation, Atlanta, GA, 1999. pp. 259–269.
5. C. G. Nevill-Manning, I. H. Witten, “Linear-Time, Incremental Hierarchy Interference for Compression,” in Proc. IEEE Data Compression Conference, 1997, pp. 3–11.
6. [61 SPEC 2000 Benchmark Suite, http://www.spec.org.
7. R. Uhlig, T. Mudge, “Trace-driven memory simulation,” ACM Computing Surveys, Vol. 29, No. 2, June 1997.
8. Y. Zhang, R. Gupta, “Timestamped Whole Program Path Representation and Its Applications,” in Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, Snowbird, Utah, 2001, pp. 180–190.
9. L. Ziv, A. Lempel, “A universal algorithm for sequential data compression,” IEEE Transaction on information's Theory, Vol. 23, No 3., 1977.