Path grammar guided trace compression and trace approximation

Proceedings of the IEEE International Symposium on High Performance Distributed Computing

Volumn 2006, Issue , 2006, Pages 57-68

  Gao, Xiaofeng ^a   Snavely, Allan ^a   Carter, Larry ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; DATA COMPRESSION; ONLINE SYSTEMS; PARALLEL PROCESSING SYSTEMS;

PATH GRAMMAR GUIDED TRACE COMPRESSION (PGGTC); TRACE APPROXIMATION; TRACE COMPRESSION; TRACE DRIVEN SIMULATION;

COMPUTER ARCHITECTURE;

EID: 33845897687     PISSN: 10828907     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. K. Skadron, M. Martonosi, D. August, M. Hill, D. Lijia, and V. Pai, "Challenges in computer architecture evaluation," in Report on National Science Foundation, 2003.
2. J. K. Flanagan, B. E. Nelson, J. K. Archibald, and G. Thompson, "The inaccuracy of trace-driven Simulation using incomplete mulitprogramming trace data," in MASCOTS, pp. 37-43, 1996.
3. X. Gao, M. Laurenzano, B. Simon, and A. Snavely, "Reducing overheads for acquiring dynamic memory traces," in IEEE International Symposium on Work-load Characterization, 2005.
4. X. Gao, B. Simon, and A. Snavely, "ALITER: An asynchronous lightweight instrumentation tool for event recording," in Workshop on Binary Instrumentation and Applications (WBIA), 2005.
5. D. H. Bailey, E. Barszcz, J. T. Barton, and et. al, "The NAS Parallel Benchmarks," The International Journal of Supercomputer Applications, vol. 5, pp. 63-73, Fall 1991.
6. "http://www.gzip.org/,"
7. J. Ziv and A. Lempel, "A universal algorithm for sequential data compression," IEEE Transactions on Information Theory, vol. 23, no. 3, pp. 337-343, 1977.
8. C. G. Nevill-Manning and I. H. Witten, "Compression and explanation using hierarchical grammars," The Computer Journal, vol. 40, no. 2/3, 1997.
9. M. B. Computer, "VPC3: A fast and effective trace-compression algorithm,"
10. L. DeRose, K. Ekanadham, J. K. Hollingsworth, and S. Sbaraglia, "SIGMA: a simulator infrastructure to guide memory analysis," in Proceedings of the 2002 ACM/IEEE conference on Supercomputing, pp. 1-13, 2002.
11. V. Bala, E. Duesterwald, and S. Banerjia, "Dynamo: a transparent dynamic optimization system," ACM SIGPLAN Notices, vol. 35, no. 5, pp. 1-12, 2000.
12. S. Nandy, X. Gao, and J. Ferrante, "TFP: Time-sensitive, flow-specific profiling at runtime," in LCPC, 2003.
13. J. R. Larus, "Whole program paths," in Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, pp. 259-269, ACM Press, 1999.
14. "http://www.zlib.net/,"
15. A. Srivastava and A. Eustace, "Atom: a system for building customized program analysis tools," in PLDI '94, pp. 196-205, ACM Press, 1994.
16. L. C. Carrington, M. Laurenzano, A. Snavely, R. L. Campbell, and L. P. Davis, "How well can simple metrics represent the performance of hpc applications?," in Proceedings of the 2005 ACM/IEEE conference on Supercomputing, p. 48, IEEE Computer Society, 2005.
17. A. D. Samples, "Mache: no-loss trace compaction," in Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, pp. 89-97, ACM Press, 1989.
18. E. E. Johnson and J. Ha, "PDATS: Lossless address space compression for reducing file size and access time," in Proceedings of 1994 IEEE International Phoenix Conference on Computers and Communication, 1994.
19. R. E. Kessler, M. D. Hill, and D. A. Wood, "A comparison of trace-sampling techniques for multi-megabyte caches," IEEE Transactions on Computers, vol. 43, no. 6, pp. 664-675, 1994.
20. D. A. Wood, M. D. Hill, and R. E. Kessler, "A model for estimating trace-sample miss ratios," 1991 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems ACM SIGMETRICS Performance Evaluation Review, vol. 19, no. 1, May 21-24, 1991.
21. X. Gao and A. Snavely, "Exploiting stability to reduce time-space cost for memory tracing," Lecture Notes in Computer Science, vol. 2659, pp. 966-975, 2003.
22. M. Matsumoto and T. Nishimura, "Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator," ACM Trans. Model. Comput. Simul., vol. 8, no. 1, pp. 3-30, 1998.
23. Y. Zhang and R. Gupta, "Timestamped whole program path representation and its applications," in Conference on Programming Language Design and Implementation, pp. 180-190, 2001.
24. C. Nevill-Manning and I. Witten, "Identifying hierarchical structure in sequences: A linear-time algorithm," in Journal of Artificial Intelligence Research, vol. 7, pp. 67-82, 1997.
25. M. Burtscher and M. Jeeradit, "Compressing extended program traces using value predictors," in International Conference on Parallel Architectures and Compilation Techniques, pp. 159-169, 2003.
26. Y. Luo and L. K. John, "Locality-based online trace compression," IEEE Transactions on Computers, vol. 9, no. 6, pp. 723-731, 2004.
27. A. Milenkovic and M. Milenkovic, "Exploiting streams in instruction and data address compression," in IEEEE 6th Annual Workshop on Workload Characterization, 2003.
28. A. Agarwal and M. Huffman, "Blocking: exploiting spatial locality for trace compaction," in Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems, pp. 48-57, 1990.
29. S. Das and E. Johnson, "Accuracy of filtered traces," in 14th Annual International Conference on Computers and Communications, 1995.
30. A. Toomula and J. Subhlok, "Replicating memory behavior for performance prediction," in Proceedings of the 7th workshop on Workshop on languages, compilers, and run-time support for scalable systems, pp. 1-8, 2004.
31. W.-H. Wang and J.-L. Baer, "Efficient trace-driven simulation methods for cache performance analysis," ACM Trans. Comput. Syst., vol. 9, no. 3, pp. 222-241, 1991.