Parallel Data Flow Analysis for OpenMP Programs

Authors:
Lei Huang;Girija Sethuraman;Barbara Chapman
Affiliations:
University of Houston, Houston, USA TX 77004;University of Houston, Houston, USA TX 77004;University of Houston, Houston, USA TX 77004
Venue:
IWOMP '07 Proceedings of the 3rd international workshop on OpenMP: A Practical Programming Model for the Multi-Core Era
Year:
2007

Citing 6
Cited 5

Analysis of event synchronization in a parallel programming tool

PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Pthreads programming

Pthreads programming
Compile-time detection of race conditions in a parallel program

ICS '89 Proceedings of the 3rd international conference on Supercomputing
Towards a more efficient implementation of OpenMP for clusters via translation to global arrays

Parallel Computing - OpenMp
OpenUH: an optimizing, portable OpenMP compiler: Research Articles

Concurrency and Computation: Practice & Experience - Current Trends in Compilers for Parallel Computers (CPC2006)
The OpenMP memory model

IWOMP'05/IWOMP'06 Proceedings of the 2005 and 2006 international conference on OpenMP shared memory parallel programming

Incorporation of OpenMP memory consistency into conventional dataflow analysis

IWOMP'08 Proceedings of the 4th international conference on OpenMP in a new era of parallelism
A technique for the effective and automatic reuse of classical compiler optimizations on multithreaded code

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ompVerify: polyhedral analysis for the OpenMP programmer

IWOMP'11 Proceedings of the 7th international conference on OpenMP in the Petascale era
On a Technique for Transparently Empowering Classical Compiler Optimizations on Multithreaded Code

ACM Transactions on Programming Languages and Systems (TOPLAS)
Experiences Developing the OpenUH Compiler and Runtime Infrastructure

International Journal of Parallel Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents a compiler framework for analyzing and optimizing OpenMP programs. The framework includes Parallel Control Flow Graph and Parallel Data Flow equations based on the OpenMP relaxed memory consistency model. It enables traditional compiler analyses as well as specific optimizations for OpenMP. Based on the framework, we describe dead code elimination and barrier elimination algorithms. An OpenMP code example is showed in the paper to illustrate the optimizations. The framework guarantees that the traditional optimizations can be performed safely to OpenMP programs, and it further increases the opportunities for more aggressive optimizations.