Array dataflow analysis for polyhedral X10 programs

Authors:
Tomofumi Yuki;Paul Feautrier;Sanjay Rajopadhye;Vijay Saraswat
Affiliations:
Colorado State University, Fort Collins, CO, USA;LIP (ENS Lyon, INRIA, CNRS, UCBL), Lyon, France;Colorado State University, Fort Collins, CO, USA;IBM Research, Yorktown Heights, NY, USA
Venue:
Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming
Year:
2013

Citing 17
Cited 0

Fuzzy array dataflow analysis

Journal of Parallel and Distributed Computing
Eraser: a dynamic data race detector for multithreaded programs

ACM Transactions on Computer Systems (TOCS)
Co-array Fortran for parallel programming

ACM SIGPLAN Fortran Forum
Instance-wise points-to analysis for loop-based dependence testing

ICS '02 Proceedings of the 16th international conference on Supercomputing
A parallel java grande benchmark suite

Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Array Dataflow Analysis for Explicitly Parallel Programs

Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
RacerX: effective, static detection of race conditions and deadlocks

SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Code Generation in the Polyhedral Model Is Easier Than You Think

Proceedings of the 13th International Conference on Parallel Architectures and Compilation Techniques
Concurrent clustered programming

CONCUR 2005 - Concurrency Theory
A theory of memory models

Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming
May-happen-in-parallel analysis of X10 programs

Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming
Parallel Programmability and the Chapel Language

International Journal of High Performance Computing Applications
Static data race detection for concurrent programs with asynchronous calls

Proceedings of the the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Featherweight X10: a core calculus for async-finish parallelism

Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Automatic verification of determinism for structured parallel programs

SAS'10 Proceedings of the 17th international conference on Static analysis
isl: an integer set library for the polyhedral model

ICMS'10 Proceedings of the Third international congress conference on Mathematical software
Deterministic parallel random-number generation for dynamic-multithreading platforms

Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the static analysis of an important class of X10 programs, namely those with finish/async parallelism, and affine loops and array reference structure as in the polyhedral model. For such programs our analysis can certify whenever a program is deterministic or flags races. Our key contributions are (i) adaptation of array dataflow analysis from the polyhedral model to programs with finish/async parallelism, and (ii) use of the array dataflow analysis result to certify determinacy. We distinguish our work from previous approaches by combining the precise statement instance-wise and array element-wise analysis capability of the polyhedral model with finish/async programs that are more expressive than doall parallelism commonly considered in the polyhedral literature. We show that our approach is exact (no false negative/positives) and more precise than previous approaches, but is limited to programs that fit the polyhedral model.