Support for fine grained dependent tasks in OpenMP

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

Abstract

OpenMP is widely used for shared memory parallel programming and is especially useful for the parallelisation of loops. When it comes to task parallelism, however, OpenMP is less powerful and the sections construct lacks support for dependences and fine grained tasks. This paper proposes a new work-sharing construct, tasks, which is a generalisation of sections. It goes beyond sections by allowing unbalanced and finer grained tasks with arbitrary dependence structure. A proof-of-concept compiler has been implemented for the new directives, which includes a state-of-the-art scheduling algorithm for task graphs. Experiments with a large set of programs were conducted using the new directives. The results demonstrate that the new approach can efficiently exploit the task parallelism inherent in the code, without introducing any additional overhead. © 2008 Springer-Verlag.

Cite

CITATION STYLE

APA

Sinnen, O., Pe, J., & Kozlov, A. V. (2008). Support for fine grained dependent tasks in OpenMP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4935 LNCS, pp. 13–24). https://doi.org/10.1007/978-3-540-69303-1_2

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