Efficient implementation of OpenMP for clusters with implicit data distribution

Authors:
Zhenying Liu;Lei Huang;Barbara Chapman;Tien-Hsiung Weng
Affiliations:
Department of Computer Science, University of Houston;Department of Computer Science, University of Houston;Department of Computer Science, University of Houston;Department of Computers Science and Information Management, Providence University
Venue:
WOMPAT'04 Proceedings of the 5th international conference on OpenMP Applications and Tools: shared Memory Parallel Programming with OpenMP
Year:
2004

Citing 9
Cited 1

Communication optimizations for irregular scientific computations on distributed memory architectures

Journal of Parallel and Distributed Computing - Special issue on scalability of parallel algorithms and architectures
Runtime and language support for compiling adaptive irregular programs on distributed-memory machines

Software—Practice & Experience
Global communication analysis and optimization

PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Global arrays: a nonuniform memory access programming model for high-performance computers

The Journal of Supercomputing
OpenMP for networks of SMPs

Journal of Parallel and Distributed Computing
Is OpenMP for Grids?

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Extending OpenMP for NUMA machines

Scientific Programming
Cluster-enabled OpenMP: An OpenMP compiler for the SCASH software distributed shared memory system

Scientific 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

Strategies and implementation for translating OpenMP code for clusters

HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses an approach to implement OpenMP on clusters by translating it to Global Arrays (GA). The basic translation strategy from OpenMP to GA is described. GA requires a data distribution; we do not expect the user to supply this; rather, we show how we perform data distribution and work distribution according to OpenMP static loop scheduling. An inspector-executor strategy is employed for irregular applications in order to gather information on accesses to potentially non-local data, group non-local data transfers and overlap communications with local computations. Furthermore, a new directive INVARIANT is proposed to provide information about the dynamic scope of data access patterns. This directive can help us generate efficient codes for irregular applications using the inspector-executor approach. Our experiments show promising results for the corresponding regular and irregular GA codes.