Title: Towards optimisation of openMP codes for synchronisation and data reuse

Authors: Tien-hsiung Weng, Barbara Chapman

Addresses: Department of Computer Science and Information Management, Providence University, Taichung County, Taiwan. ' Department of Computer Science, University of Houston, TX 77204-3010, USA

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.

Keywords: shared memory parallel programming; task graph; task scheduling; compiler optimisation; openMP codes; synchronisation; data reuse; high performance computing.

DOI: 10.1504/IJHPCN.2004.007564

International Journal of High Performance Computing and Networking, 2004 Vol.1 No.1/2/3, pp.43 - 54

Published online: 05 Aug 2005 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article