Array Dataflow Analysis for Polyhedral X10 Programs

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.
Type de document :
Communication dans un congrès
18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP'13), Feb 2013, Shenzhen, China. ACM, 2013
Liste complète des métadonnées

https://hal.inria.fr/hal-00761537
Contributeur : Alain Darte <>
Soumis le : mercredi 5 décembre 2012 - 16:26:31
Dernière modification le : jeudi 22 novembre 2018 - 12:50:02

Identifiants

  • HAL Id : hal-00761537, version 1

Collections

Citation

Tomofumi Yuki, Paul Feautrier, Sanjay Rajopadhye, Vijay Saraswat. Array Dataflow Analysis for Polyhedral X10 Programs. 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP'13), Feb 2013, Shenzhen, China. ACM, 2013. 〈hal-00761537〉

Partager

Métriques

Consultations de la notice

261