Compactly representing parallel program executions

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Volumn , Issue , 2003, Pages 191-202

  Goel, Ankit ^a   Roychoudhury, Abhik ^a   Mitra, Tulika ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Dynamic program analysis; Path profiling; Program path compression

Indexed keywords

ALGORITHMS; NETWORK PROTOCOLS; PARALLEL PROCESSING SYSTEMS;

PATH PROFILING;

COMPUTER PROGRAMMING;

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

References (25)

1. S.V. Adve, M.D. Hill, B.P. Miller, and R.H.B. Netzer. Detecting data races in weak memory systems. In ACM International Symposium on Computer Architecture (ISCA), 1991.
2. R. Alur and R. Grosu. Shared variable interaction diagrams. In International Conference on Automated Software Engineering (ASE), 2001.
3. R. Alur, G.J. Holzmann, and D.A. Peled. An analyzer for message sequence charts. In International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS), LNCS 1055, 1996.
4. T.M. Chilimbi. Efficient representations and abstractions for quantifying and exploiting data reference locality. In ACM International Conference on Programming Language Design and Implementation (PLDI), 2001.
5. J-D. Choi and S.L. Min. Race frontier: Reproducing data races in parallel program debugging. In ACM International Conference on Principles and Practice of Parallel Programming (PPoPP), 1991.
6. D.E. Culler, J.P. Singh, and A. Gupta. Parallel Computer Architecture; A Hardware/Software Approach. Morgan Kaufmann, 1999.
7. A. Dinning and E. Schonberg. An empirical comparison of monitoring algorithms for access anomaly detection. In ACM International Conference on Principles and Practice of Parallel Programming (PPoPP), 1990.
8. C.J. Hughes, V.S. Pai, P. Ranganathan, and S.V. Adve. RSIM: Simulating shared-memory multiprocessors with ILP processors. IEEE Computer, 35(2), 2002.
9. P. Keleher, S. Dwarkadas, A. L. Cox, and W. Zwaenepoel. Treadmarks: Distributed shared memory on standard workstations and operating systems. In Winter USENIX Conference, 1994.
10. R. Konuru, H. Srinivasan, and J-D. Choi. Deterministic replay of distributed java applications. In International Parallel and Distributed Processing Symposium (IPDPS), 2000.
11. J.R. Larus. Whole program paths. In ACM International Conference on Programming Language and Implementation (PLDI), 1999.
12. R.H.B. Netzer. Optimal tracing and replay for debugging shared-memory parallel programs. In ACM/ONR Workshop on Parallel and Distributed Debugging, 1993.
13. R.H.B. Netzer and B.P. Miller. Improving the accuracy of data race detection. In ACM International Conference on Principles and Practice of Parallel Programming (PPoPP), 1991.
14. G.G. Nevill-Manning and I.H. Witten. Identifying hierarchical structure in sequences: A linear-time algorithm. Journal of Artificial Intelligence Research, 7, 1997.
15. A.R. Pleszkun. Techniques for compressing program address traces. In IEEE/ACM International Symposium on Microarchitecture (MICRO), 1994.
16. S.P. Reiss and M. Renieris. Encoding program executions. In ACM/IEEE International Conference on Software Engineering (ICSE), 2001.
17. M.C. Rinard. Analysis of multithreaded programs. In Static Analysis Symposium (SAS), 2001.
18. M. Ronsse and K. de Bosschere. Recplay: A fully integrated practical record/replay system. ACM Transactions on Computer Systems, 17(2), 1999.
19. M. Russinovich and B. Cogswell. Replay for concurrent non-deterministic shared memory applications. In ACM International Conference on Programming Language Design and Implementation (PLDI), 1996.
20. S. Savage et al. Eraser: a dynamic data race detector for multithreaded programs. ACM Transactions on Computer Systems, 15(4), 1997.
21. J.P. Singh, W-D. Weber, and A. Gupta. SPLASH: Stanford parallel applications for shared-memory. ACM SIGARCH Computer Architecture News, 20(1), 1992.
22. S. C. Woo et al. The SPLASH-2 programs: Characterization and methodological considerations. In International Symposium on Computer Architecture (ISCA), 1995
23. Z.120. Message Sequence Charts (MSC'96), 1996.
24. Y. Zhang and R. Gupta. Timestamped whole program path representation and its applications. In ACM International Conference on Programming LanguageDesign and Implementation (PLDI), 2001.
25. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 23(3), 1977.