An efficient single-pass trace compression technique utilizing instruction streams

ACM Transactions on Modeling and Computer Simulation

Volumn 17, Issue 1, 2007, Pages

  Milenkovi, Aleksandar ^a,c   Milenkovi, Milena ^b  

^a UNIVERSITY OF ALABAMA IN HUNTSVILLE   (United States)

^b IBM   (United States)

^c UNIVERSITY OF ALABAMA IN HUNTSVILLE   (United States)

Author keywords

Instruction and data traces; Instruction streams; Trace compression

Indexed keywords

COMPRESSION RATIO; DATA ADDRESS; DECOMPRESSION; INSTRUCTION STREAMS; STREAM BASED COMPRESSION (SBC);

COMPUTER ARCHITECTURE; COMPUTER SOFTWARE; DATA FLOW ANALYSIS; DATA STORAGE EQUIPMENT; LOGIC DESIGN;

DATA COMPRESSION;

EID: 33846377488     PISSN: 10493301     EISSN: 15581195     Source Type: Journal    
DOI: 10.1145/1189756.1189758     Document Type: Article

References (36)

1. AGARWAL, A., SITES, R. L., AND HOROWITZ, M. 1986. ATUM: A new technique for capturing address traces using microcode. In Proceedings of the 13th Annual Symposium, on Computer Architecture (Tokyo, Japan, June), 119-127.
2. ARM. 2004. CoreSight On-chip Debug and Trace Technology, 〈http://www.arm.com/products/solutions/CoreSight.html〉 (July 2004).
3. BECKER, J. C. AND PARK, A. 1993. An analysis of the information content of address and data reference streams. In Proceedings of the 1993 ACM BIOMETRICS Conference on Measurement and Modeling of Computer Systems (Santa Clara, CA, May 10-14). ACM, New York, 262-263.
4. BURGER, D. AND AUSTIN, T. 1997. The SimpleScalar Tool Set version 2.0. CS-TR-97-1342, University of Wisconsin.
5. BURROWS, M. AND WHEELER, D. J. 1994. A Block-sorting lossless data compression algorithm. Report 124, Digital SRC.
6. BURTSCHER, M. 2004. VPC3: A fast and effective trace-compression algorithm. In Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems (SIOMETRICS'04) (New York, NY, June). ACM, New York, 167-176.
7. BURTSCHER, M., GANUSOV, I., JACKSON, S. J., KE, J., RATANAWORABHAN, P., AND SAM, N. B. 2005. The VPC Trace-Compression Algorithms. IEEE Trans. Comput. 54, 11 (Nov.), 1329-1344.
8. BURTSCHER, M. AND JEERADIT, M. 2003. Compressing extended program traces using value predictors. In Proceedings of the 12th International Conference on Parallel Architectures and Compilation Techniques (New Orleans, LA, Sept.). 159-168.
9. BURTSCHER, M. AND SAM, N. B. 2005. Automatic generation of high-performance trace compressors. In Proceedings of the 2005 International Symposium, on Code Generation and Optimization (CGO'05) (San Jose, CA, Mar.), pp. 229-240.
10. CANTIN, J. F. AND HILL, M. D. 2003. Cache Performance for SPEC CPU2000 Benchmarks. 〈http://www.cs.wisc.edu/multifacet/misc/ spec2000cache-data/〉 (April 2004).
11. DEROSE, L., EKANADHAM, K. HOLLINGSWORTH, J. K., AND SBARAGLIA, S. 2002. SIGMA: A simulator infrastructure to guide memory analysis. In Proceedings of the 2002 ACM/IEEE Conference on Supercomputing (Baltimore, MD). IEEE Computer Society Press, Los Alamitos, CA, 1-13.
12. EDLER, J. AND HILL, M. D. 1998. Dinero IV Trace-Driven Uniprocessor Cache Simulator. 〈http://www.cs.wisc.edu/~markhill/DineroIV/ 〉 (August 2003).
13. EGGERS, S. J., KEPPEL, D. R., KOLDINGER, E. J., AND LEVY, H. M. 1990. Techniques for efficient inline tracing on a shared-memory multiprocessor. In Proceedings of the 1990 ACM BIOMETRICS Joint International Conference on Measurement and Modeling of Computer Systems (Boulder, CO). ACM, New York, 37-47.
14. ELNOZAHY, E. N. 1999. Address trace compression through loop detection and reduction. ACM BIOMETRICS Performance Evaluation Review 27, 1 (June), 214-215.
15. FISHER, J. A., FARABOSCHI, P., AND YOUNG, C. 2005. Embedded Computing: A VLIW Approach in Architecture, Compilers, and Tools. Morgan Kaufmann, San Francisco, CA.
16. HAMOU-LHADJ, A. AND LETHBRIDGE, T. C. 2002. Compression techniques to simplify the analysis of large execution traces. In Proceedings of the 10th International Workshop on Program Comprehension (Paris, France, June 27-29). 159-168.
17. JOHNSON, E. E., HA, J., AND ZAIDI, M. B. 2001. Lossless trace compression. IEEE Trans. Comput. 50, 2 (Feb.). 158-173.
18. LARUS, J. R. 1993. Efficient program tracing. IEEE Comput. 26, 5 (May 1993), 52-61.
19. LARUS, J. R. 1999. Whole program paths. In Proceedings of the ACM SIGPLAN 1999 Conference on Programming Language Design and Implementation (Atlanta, GA). ACM, New York, 259-269.
20. LUO, Y., AND JOHN, L. K. 2004. Locality-based online trace compression. IEEE Trans. Comput. 53, 6 (June). 723-731.
21. MCCULLOUGH, D. I. AND TRAYLOR, L. A. 2003. Trace reporting method and system. United States Patent 6,615,371.
22. MILENKOVIC, A., AND MILENKOVIC, M. 2003a. Exploiting streams in instruction and data address trace compression. In Proceedings of IEEE 6th Annual Workshop on Workload Characterization (Austin, TX, October 27, 2003). IEEE Computer Society Press, Los Alamitos, CA, 99-107.
23. MILENKOVIC, A. AND MILENKOVIC, M. 2003b. Stream-based trace compression. Computer Architect. Lett. 2. (Sept.).
24. MILENKOVIC, A., MILENKOVIC, M., AND KULICK, J. 2003. N-tuple compression: A novel method for compression of branch instruction traces. In Proceedings of the 16th International Conference on Parallel and Distributed Computing Systems (PDCS-2003) (Reno, NV, Aug. 13-15). 49-55.
25. NEVILL-MANNING, C. G. AND WITTEN, I. H. 1997. Linear-time, incremental hierarchy interference for compression. In Proceedings of the IEEE Data Compression Conference (Snowbird, UT). IEEE Computer Society Press, Los Alamitos, CA, 3-11.
26. PLESZKUN, A. R. 1994. Techniques for compressing program address traces. In Proceedings of the 27th Annual International Symposium on Microarchitecture (San Jose, CA, Nov. 30-Dec. 02, 1994). 32-39.
27. SAMPLES, A. D. 1989. Mache: no-loss trace compaction. In Proceedings of the 1989 ACM SIOMETRICS International Conference on Measurement and Modeling of Computer Systems (Oakland, CA, May 23-26). ACM, New York, 89-97.
28. SKADRON, K., MARTONOSI, M., AUGUST, D. L, HILL, M. D., LILJA, D. J., AND PAI, V. S. 2003. Challenges in computer architecture evaluation. IEEE Comput. 36, 8 (Aug.), 30-36.
29. SMITH, M. D. 1991. Tracing with Pixie. Tech. Rep. CSL-TR-91-497. Computer Systems Laboratory, Stanford University, Stanford, CA.
30. SPEC. 2000. SPEC 2000 CPU Benchmark Suite, 〈http://www.spec. org〉 (February 2004).
31. THORNOCK, N. C. AND FLANAGAN, J. K. 2001. A national trace collection and distribution resource. ACM SIGARCH Comput. Archit. News 29, 3 (June), 6-10.
32. UHLIG, R., NAGLE, D., MUDGE, T., SECHREST, S., AND EMER, J. 1995. Instruction fetching: Coping with code bloat. In Proceedings of the 22nd Annual International Symposium on Computer Architecture (S. Margherita Ligure, Italy). ACM, New York, 345-356.
33. UHLIG, R. A. AND MUDGE, T. N. 1997. Trace-driven memory simulation: A survey. ACM Comput. Surv. 29, 2 (June), 128-170.
34. ZHANG, Y AND GUPTA, R. 2001. Timestamped whole program path representation and its applications. In Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation (Snowbird, UT). ACM, New York, 180-190.
35. ZHOU, M. AND SMITH, A. J. 2000. Tracing Windows95. Microproc. Microsyst. 24, 333-347.
36. ZIV, J., AND LEMPEL, A. 1977. A universal algorithm for sequential data compression. IEEE Trans. Inform. Theory 23, 3 (May), 337-343.