May-happen-in-parallel analysis of X10 programs

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

Volumn , Issue , 2007, Pages 183-193

  Agarwal, Shivali ^a   Barik, Rajkishore ^b   Sarkar, Vivek ^c   Shyamasundar, Rudrapatna K ^b  

^a TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

^b IBM INDIA RESEARCH LAB   (India)

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

Author keywords

Activity; Atomic; Concurrent; May happen in parallel; Parallel program analysis; Place; X10

Indexed keywords

ALGORITHMS; COMPUTER SYSTEMS; CONCURRENCY CONTROL; JAVA PROGRAMMING LANGUAGE; MATHEMATICAL MODELS; OBJECT ORIENTED PROGRAMMING; OPTIMIZATION;

PARALLEL PROGRAM ANALYSIS; PROGRAM STRUCTURE TREE; X10 PROGRAMMING;

PARALLEL PROGRAMMING;

EID: 34748888287     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1229428.1229471     Document Type: Conference Paper

References (24)

1. B. Alpern, M. N. Wegman, and F. K. Zadeck. Detecting equality of variables in programs. In POPL '88: Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 1-11, New York, NY, USA, 1988. ACM Press.
2. Rajkishore Barik. Efficient computation of may-happen-in-parallel information for concurrent java programs. In 18th International Workshop on languages and Compilers for Parallel Computing, October 2005.
3. David Callahan and Jaspai Sublok. Static analysis of low-level synchronization. In PADD '88: Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on Parallel and distributed debugging, pages 100-111, New York, NY, USA, 1988. ACM Press.
4. Philippe Charles, Christopher Donawa, Kemal Ebcioglu, Christian Grothoff, Allan Kielstra, Christoph von Praun, Vijay Saraswat, and Vivek Sarkar. X10: An object-oriented approach to non-uniform cluster computing. In OOPSIA 2005 Onward! Track, 2005.
5. Jong-Deok Choi, Keunwoo Lee, Alexey Loginov, Robert O'Callahan, Vivek Sarkar, and Manu Sridharan. Efficient and precise datarace detection for multithreaded object-oriented programs. In PLDI '02: Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, pages 258-269, New York, NY, USA, 2002. ACM Press.
6. Evelyn Duesterwald and Mary Lou Soffa. Concurrency analysis in the presence of procedures using a data-flow framework. In TAV4: Proceedings of the symposium on Testing, analysis, and verification, pages 36-48, New York, NY, USA, 1991. ACM Press.
7. J. Ferrante, K. Ottenstein, and J. Warren. The Program Dependence Graph and its Use in Optimization. ACM Transactions on Programming languages and Systems, 9(3):319-349, July 1987.
8. Dov Harel. A Linear Time Algorithm, for Finding Dominators in Flow Graphs and Related Problems. Symposium on Theory of Computing, May .1985.
9. Fen-ante J, Grunwald D, and Srinivasan H. Compile-time analysis and optimization of explicitly parallel programs. In Journal of Parallel algorithms and applications, 1997.
10. Jens Krinke. Static slicing of threaded programs. In Workshop on Program Analysis For Software Tools and Engineering, pages 35-42, 1998.
11. Jaejin Lee. Compilation Techniques for Explicitly Parallel Programs. PhD thesis, University of Illinois at Urbana-Champaign, 1999.
12. T. Lengauer and Robert Tarjan. A Fast Algorithm for Finding Dominators in a Flowgraph. TOPLAS, July 1979.
13. Lin Li and Clark Verbrugge. A practical mhp information analysis for concurrent java programs. In The 17th International Workshop on Languages and Compilers for Parallel Computing (LCPC'04), 2004.
14. Stephen P. Masticola and Barbara G. Ryder. A model of ada programs for static deadlock detection in polynomial times. In PADD '91: Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging, pages 97-107, New York, NYUSA, 1991. ACM Press.
15. Stephen P. Masticola and Barbara G. Ryder. Non-concurrency analysis. In PPOPP '93: Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming, pages 129-138, New York, NY, USA, 1993. ACM Press.
16. G. Naumovich, G. S. Avruin, and L. A. Clarke. Data flow analysis for checking properties of concurrent java programs. Technical Report UM-CS-1998-022, 1998.
17. Gleb Naumovich and George S. Avrunin. A conservative data flow algorithm for detecting all pairs of statements that may happen in parallel. In SIGSOFT '98/FSE-6: Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering, pages 24-34, New York, NY, USA, 1998. ACM Press.
18. Gleb Naumovich, George S. Avrunin, and Lori A. Clarke. An efficient algorithm, for computing MHP information for concurrent Java programs. In Proceedings of the joint 7th European Software Engineering Conference and 7th ACM SIGSOFT Symposium on the Foundations of Software Engineering, pages 338-354, September 1999.
19. X10 release on SourceForge. http://x10.sf.net.
20. Vivek Sarkar. A Concurrent Execution Semantics for Parallel Program Graphs and Program. Dependence Graphs (Extended. Abstract). Springer-Verlag lecture Notes in Computer Science, 757: 16-30, 1992. Proceedings of the Fifth Workshop on Languages and Compilers for Parallel Computing, Yale University, August 1992.
21. Vivek Sarkar. Analysis and Optimization of Explicitly Parallel Programs using the Parallel Program Graph Representation. In Languages and compilers for parallel computing. Proceedings of the 10th international workshop. Held Aug., 1997 in Minneapolis, MN, Lecture Notes in Computer Science. Springer-Verlag, New York, 1998.
22. Vivek Sarkar and Barbara Simons. Parallel Program Graphs and their Classification. Springer-Verlag Lecture Notes in Computer Science, 768:633-655, 1993. Proceedings of the Sixth Workshop on Languages and Compilers for Parallel Computing, Portland, Oregon, August 1993.
23. Richard N. Taylor. Complexity of analyzing the synchronization structure of concurrent programs. Acta Inf., 19:57-84, 1983.
24. Michael J. Wolfe. Optimizing Supercompilers for Supercomputers. Pitman, London and The MIT Press, Cambridge, Massachusetts, 1989. In the series, Research Monographs in Parallel and Distributed Computing.