Data-flow analysis for MPI programs

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2006, Pages 175-184

  Strout, Michelle Mills ^a   Kreaseck, Barbara ^b   Hovland, Paul D ^c  

^a Department of Environmental and Radiological Health Sciences   (United States)

^b LA SIERRA UNIVERSITY   (United States)

^c ARGONNE NATIONAL LABORATORY   (United States)

Author keywords

Activity analysis; Data flow analysis; MPI; MPI ICFG; SPMD

Indexed keywords

CIRCUIT SIMULATION; CONTEXT SENSITIVE GRAMMARS; DATA FLOW ANALYSIS; GRAPH THEORY; STORAGE ALLOCATION (COMPUTER); VIRTUAL REALITY;

ACTIVITY ANALYSIS; INTERPROCEDURAL ANALYSIS; MPI-ICFG; SPMD; STORAGE REQUIREMENTS;

PARALLEL ALGORITHMS;

EID: 34547469429     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2006.32     Document Type: Conference Paper

References (40)

1. D. Bailey, T. Harris, W. Saphir, R. van der Wijngaart, A. Woo, and M. Yarrow. The NAS Parallel Benchmarks 2.0. Technical Report NAS-95-020, Nasa Ames Research Center, Moffet Field, CA, 1995.
2. D. W. Binkley and K. B. Gallagher. Program slicing. Advances in Computers, 43:1-50, 1996.
3. C. Bischof, A. Carle, P. Khademi, and A. Mauer. ADI-FOR 2.0: Automatic differentiation of Fortran 77 programs. IEEE Computational Science & Engineering, 3(3): 18-32, 1996.
4. C. H. Bischof, P. D. Hovland, and B. Norris. Implementation of automatic differentiation tools. In Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pages 98-107, January 2002.
5. G. Burns, R. Daoud, and J. Vaigl. LAM: An open cluster environment for MPI. In Proceedings of the Supercomputing Symposium, pages 379-386, 1994.
6. A. Carle. Automatic Differentiation, pages 701-719. Morgan Kaufmann Publishers, 2003.
7. J. Cheng. Dependence analysis of parallel and distributed programs and its applications, 1997.
8. P. Dutto and C. Faure. Extension of Odyssée to the MPI library: The direct mode. Rapport de Recherche 3715, INRIA, 1999.
9. M. B. Dwyer and L. A. Clarke. A flexible architecture for building data flow analyzers. In Proceedings of the 18th International Conference on Software Engineering, pages 554-564. IEEE Computer Society Press, 1996.
10. M. B. Dwyer, L. A. Clarke, J. M. Cobleigh, and G. Naumovich. Flow analysis for verifying properties of concurrent software systems. ACM Transactions Software Engineering Methodology, 13(4):359-430, 2004.
11. R. Giering and T. Kaminski. Applying TAF to generate efficient derivative code of Fortran 77-95 programs. In Proceedings of GAMM 2002, 2002.
12. W. Gropp, E. Lusk, N. Doss, and A. Skjellum. A high-performance, portable implementation of the MPI message passing interface standard. Parallel Computing, 22(6):789-828, Sept. 1996.
13. W. D. Gropp and E. Lusk. User's guide for mpich, a portable implementation of MPI. Technical Report ANL-96/6, Mathematics and Computer Science Division, Argonne National Laboratory, 1996.
14. D. Grunwald and H. Srinivasan. Data flow equations for explicitly parallel programs. In Proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 159-168, 1993.
15. S. Guyer and C. Lin. Client-driven pointer analysis. In Static Analysis Symposium (SAS), 2003.
16. M. W. Hall, J. M. Mellor-Crummey, A. Carle, and R. G. Rodriguez. FIAT: A framework for interprocedural analysis and transfomation. In Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing, pages 522-545, 1994.
17. L. Hascoet, U. Naumann, and V. Pascual. "to be recorded" analysis in reverse-mode automatic differentiation. Future Generation Computer Systems, 21(8), 2004.
18. P. Hovland. Automatic Differentiation of Parallel Programs. PhD thesis, University of Illinois at Urbana-Champaign, 1997.
19. P. Hovland, C. Bischof, D. Spiegelman, and M. Casella. Efficient derivative codes through automatic differentiation and interface contraction: An application in biostatistics. SIAM Journal on Scientific Computing, 18(4): 1056-1066, 1997.
20. J. Knoop. Constant propagation in explicitly parallel programs. In Proceedings of Euro-Par, LNCS 1470. Springer, 1998.
21. J. Knoop, B. Steffen, and J. Vollmer. Parallelism for free: efficient and optimal bitvector analyses for parallel programs. ACM Transactions on Programming Languages and Systems (TOPLAS), 18(3):268-299, 1996.
22. J. Krinke. Static slicing of threaded programs. In Proceedings ACM SIGPLAN/SIGFSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE), pages 35-42, 1998.
23. J. Krinke. Context-sensitive slicing of concurrent programs. In European Software Engineering Conference and ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE), 2003.
24. A. Krishnamurthy and K. A. Yelick. Optimizing parallel SPMD programs. In Languages and Compilers for Parallel Computing, pages 331-345, 1994.
25. W. Landi and B. G. Ryder. A safe approximate algorithm for interprocedural aliasing. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 1992.
26. Lawrence Livermore, Los Alamos, and Sandia National Laboratories. The accelerated strategic computing initiative (ASCI) sweep3d benchmark code, 1995. http://www.llnl.gov/asci_benchmarks/asci/limited/sweep3d/asci_sweep3d.html.
27. J. Lee, D. A. Padua, and S. P. Midkiff. Basic compiler algorithms for parallel programs. In Proceedings of the Seventh ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 1999.
28. D. Long and L. A. Clarke. Data flow analysis of concurrent systems that use the rendezvous model of synchronization. In TAV4: Proceedings of the Symposium on Testing, Analysis, and Verification, pages 21-35, New York, 1991. ACM Press.
29. R. McConnell. Personal communication, 2005.
30. Message Passing Interface Forum. MPI: A Message-Passing Interface standard. International Journal of Supercomputer Applications, 8(3/4): 165-414, 1994.
31. U. Naumann. Reducing the memory requirement in reverse mode automatic differentiation by solving TBR flow equations. In P. M. A. Sloot, C. J. K. Tan, J. J. Dongarra, and A. G. Hoekstra, editors, Computational Science - ICCS 2002, Proceedings of the International Conference on Computational Science, Amsterdam, The Netherlands, April 21-24, 2002. Part II, volume 2330 of LNCS, pages 1039-1048. Springer, 2002.
32. J. H. Reif and S. A. Smolka. Data flow analysis of distributed communicating processes. International of Journal Parallel Programming, 19(1): 1-30, 1990.
33. T. Reps and G. Rosay. Precise interprocedural chopping. ACM SIGSOFT Software Engineering Notes, 20(4):41-52, 1995.
34. Rice University. Open64 project. http://www.hipersoft.rice.edu/open64/.
35. D. Shires, L. Pollock, and S. Sprenkle. Program flow graph construction for static analysis of mpi programs. In International Conference on Parallel and Distributed Processing Techniques and Applications, (PDPTA 99), June 1999.
36. S. Siegel. Personal communication, 2004.
37. J. M. Squyres and A. Lumsdaine. A Component Architecture for LAM/MPI. In Proceedings of the 10th European PVM/MPI Users' Group Meeting, volume 2840 of LNCS, pages 379-387. Springer-Verlag, 2003.
38. M. Stephenson, J. Babb, and S. Amarasinghe. Bidwidth analysis with application to silicon compilation. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 108-120, 2000.
39. M. M. Strout, J. Mellor-Crummey, and P. Hovland. Representation- independent program analysis. In Proceedings of the The sixth ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE), September 5-6 2005.
40. S. W. Tjiang and J. L. Hennessy. Sharlit-a tool for building optimizers. In The ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 1992.