Incorporation of openmp memory consistency into conventional dataflow analysis

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Current OpenMP compilers are often limited in their analysis and optimization of OpenMP programs by the challenge of incorporating OpenMP memory consistency semantics into conventional data flow algorithms. An important reason for this is that data flow analysis within current compilers traverse the program's control-flow graph (CFG) and the CFG does not accurately model the memory consistency specifications of OpenMP. In this paper, we present techniques to incorporate memory consistency semantics into conventional dataflow analysis by transforming the program's CFG into an OpenMP Producer-Consumer Flow Graph (PCFG), where a path exists from writes to reads of shared data if and only if a dependence is implied by the OpenMP memory consistency model. We present algorithms for these transformations, prove the correctness of these algorithms and discuss a case where this transformation is used. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Basumallik, A., & Eigenmann, R. (2008). Incorporation of openmp memory consistency into conventional dataflow analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5004 LNCS, pp. 71–82). Springer Verlag. https://doi.org/10.1007/978-3-540-79561-2_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free