Towards optimisation of openMP codes for synchronisation and data reuse

Authors:
Tien-hsiung Weng;Barbara Chapman
Affiliations:
Department of Computer Science and Information Management, Providence University, Taichung County, Taiwan.;Department of Computer Science, University of Houston, TX 77204-3010, USA
Venue:
International Journal of High Performance Computing and Networking
Year:
2004

Citing 21
Cited 0

Direct parallelization of call statements

SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
A technique for summarizing data access and its use in parallelism enhancing transformations

PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
A practical algorithm for exact array dependence analysis

Communications of the ACM
PYRROS: static task scheduling and code generation for message passing multiprocessors

ICS '92 Proceedings of the 6th international conference on Supercomputing
List scheduling with and without communication delays

Parallel Computing
Evaluating compiler optimizations for Fortran D

Journal of Parallel and Distributed Computing - Special issue on data parallel algorithms and programming
Symbolic array dataflow analysis for array privatization and program parallelization

Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Symbolic analysis for parallelizing compilers

ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic evaluation for parallelizing compilers

ICS '97 Proceedings of the 11th international conference on Supercomputing
SMARTS: exploiting temporal locality and parallelism through vertical execution

ICS '99 Proceedings of the 13th international conference on Supercomputing
Is data distribution necessary in OpenMP?

Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Exploiting memory affinity in OpenMP through schedule reuse

ACM SIGARCH Computer Architecture News - Special Issue: PACT 2001 workshops
The range test: a dependence test for symbolic, non-linear expressions

Proceedings of the 1994 ACM/IEEE conference on Supercomputing
An Implementation of Interprocedural Bounded Regular Section Analysis

IEEE Transactions on Parallel and Distributed Systems
Complex Pipelined Executions in OpenMP Parallel Applications

ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
Implementing OpenMP Using Dataflow Execution Model for Data Locality and Efficient Parallel Execution

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Heterogeneous HPC Environments

Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Implementing Pipelined Computation and Communication in an HPF Compiler

Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
Interprocedural Array Region Analyses

LCPC '95 Proceedings of the 8th International Workshop on Languages and Compilers for Parallel Computing
Analyses for the translation of OpenMP codes into SPMD style with array privatization

WOMPAT'03 Proceedings of the OpenMP applications and tools 2003 international conference on OpenMP shared memory parallel programming
Improving the performance of OpenMP by array privatization

WOMPAT'03 Proceedings of the OpenMP applications and tools 2003 international conference on OpenMP shared memory parallel programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present the compiler transformation of OpenMP code to an ordered collection of tasks, and the compile time as well as runtime mapping of the resulting task graph to threads for data reuse. The ordering of tasks is relaxed where possible so that the code may be executed in a more loosely synchronous fashion. Our current implementation uses a runtime system that permits tasks to begin execution as soon as their predecessors have completed. A comparison of the performance of two example programs in their original OpenMP form and in the code form resulting from our translation is encouraging.