Barrier matching for programs with textually unaligned barriers

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

Volumn , Issue , 2007, Pages 194-204

  Zhang, Yuan ^a   Duesterwald, Evelyn ^b  

^a UNIVERSITY OF DELAWARE   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Barrier synchronization; MPI; Path expressions; Slicing; Static analysis

Indexed keywords

ERRORS; MATHEMATICAL MODELS; PARALLEL PROGRAMMING; STATIC ANALYSIS;

BARRIER SYNCHRONIZATION; PATH EXPRESSIONS;

SYNCHRONIZATION;

EID: 34748813043     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1229428.1229472     Document Type: Conference Paper

References (29)

1. Alexander Aiken and David Gay. Barrier inference. In Proceedings of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 342-354, 1998.
2. L.O. Andersen. Program Analysis and Specialization For the C Programming Language. PhD thesis, University of Copenhagen, 1994.
3. David Callahan, Ken Kennedy, and Jaspal Subhlok. Analysis of event synchronization in a parallel programming tool. In Proceedings of the Second ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, pages 21-30, Seattle, Washington, March 1990.
4. Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451-490, October 1991.
5. Alain Darte and Robert Schreiber. A linear-time algorithm for optimal barrier placement. In Proceedings of the tenth ACM SIGPLAN symposium on Principles and Practice of Parallel Programming, pages 26-35, 2005.
6. Evelyn Duesterwald and Mary Lou Soffa. Concurrency analysis in the presence of procedures using a data-flow framework. In Proceedings of the Symposium on Testing, Analysis, and Verification, pages 36-48, 1991.
7. Ana M. Erosa and Laurie J. Hendren. Taming control flow: A structured approach to eliminating goto statements. In Proceedings of the 1994 International Conference on Computer Languages, pages 229-240, Toulouse, France, May 1994.
8. Cormac Flanagan, Stephen N. Freund, Shaz Qadeer, and Sanjit A. Seshia. Modular verification of multithreaded programs. Theor. Comput. Sci., 338(1-3):153-183, 2005.
9. Susan Horwitz, Thomas Reps, and David Binkley. Interprocedural slicing using dependence graphs. ACM Transactions on Programming Languages and Systems, 12(1):26-60, January 1990.
10. Tor E. Jeremiassen and Susan J. Eggers. Static analysis of barrier synchronization in explicitly parallel systems. In Proceedings of the IFIP WG 10.3 Working Conference on Parallel Architectures and Compilation Techniques, PACT '94, pages 171-180, Montréal, Québec, August 1994. North-Holland Publishing Company.
11. A Krishnamoorthy, D Culler, A Dusseau, S Goldstein, S Lumetta, T von Eicken, and K Yelick. Parallel Programming in Split-C. In Supercomputing '93 Proceedings, pages 262-273, November 1993.
12. Arvind Krishnamurthy and Katherine Yelick. Analyses and optimizations for shared address space programs. J. Parallel Distrib. Comput., 38(2): 130-144, 1996.
13. Yuan Lin. Static nonconcurrency analysis of openmp programs. In Fist International Workshop on OpenMP, 2005.
14. OpenMP C/C++ Manual, http://www.openmp.org/specs/.
15. Stephen P. Masticola and Barbara G. Ryder. Non-concurrency analysis. In Proceedings of the Fourth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, pages 129-138, San Diego, California, May 1993.
16. Michael O'Boyle and Elena Stohr. Compile time barrier synchronization minimization. IEEE Trans. Parallel Distrib. Syst., 13(6):529-543, 2002.
17. Karl J. Ottenstein and Linda M. Ottenstein. The program dependence graph in a software development environment. Software Engineering Notes, 9(3), 1984.
18. P.Hulfinger, D.Bonachea, K.Datta, D.Gay, S.Graham, B.Liblit, G.Pike, J.Su, and K.Yelick. Titanium language reference manual. Technical Report UCB/EECS-2005-15, U.C.Berkeley, 2005.
19. Shuyi Shao, Alex K. Jones, and Rami Melhem. A compiler-based communication analysis approach for multiprocessor systems, 2006.
20. Stephen F. Siegel and George S. Avrunin. Modeling wildcard-free mpi programs for verification. In Proceedings of the tenth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 95-106, 2005.
21. Stephen F. Siegel, Anastasia Mironova, George S. Avrunin, and Lori A. Clarke. Using model checking with symbolic execution to verify parallel numerical programs. In Proceedings of the 2006 International Symposium on Software Testing and Analysis, pages 157-168, 2006.
22. The Message Passing Interface (MPI) standard. http://www-unix.mcs.anl. gov/mpi/.
23. Robert E. Tarjan. Fast algorithms for solving path problems. Journal of the ACM, 28(3):594-614, July 1981.
24. Robert E. Tarjan. A unified approach to path problems. Journal of the ACM, 28(3):577-593, July 1981.
25. Steven W. K. Tjiang and John L. Hennessy. Sharlit - a tool for building optimizers. In Proceedings of the ACM SIGPIAN '92 Conference on Programming Language Design and Implementation, pages 82-93, San Francisco, California, June 1992.
26. Chau-Wen Tseng. Compiler optimizations for eliminating barrier synchronization. In Proceedings of the Fifth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, pages 144-155, Santa Barbara, California, July 1995.
27. Peng Tu and David Padua. Gated SSA-based demanddriven symbolic analysis for parallelizing compilers. In Conference Proceedings, 1995 International Conference on Supercomputing, pages 414-423, Barcelona, Spain, July 1995.
28. G. A. Venkatesh. The semantic approach to program slicing. In Proceedings of the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation, pages 107-119, Toronto, Ontario, June 1991.
29. Mark Weiser. Program slicing. IEEE Transactions on Software Engineering, 10(4):352-357, July 1984.