Abstract
Tasking in OpenMP 3.0 has been conceived to handle the dynamic generation of unstructured parallelism. New directives have been added allowing the user to identify units of independent work (tasks) and to define points to wait for the completion of tasks (task barriers). In this paper we propose an extension to allow the runtime detection of dependencies between generated tasks, broading the range of applications that can benefit from tasking or improving the performance when load balancing or locality are critical issues for performance. Furthermore the paper describes our proof-of-concept implementation (SMP Superscalar) and shows preliminary performance results on an SGI Altix 4700. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Duran, A., Perez, J. M., Ayguadé, E., Badia, R. M., & Labarta, J. (2008). Extending the openmp tasking model to allow dependent tasks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5004 LNCS, pp. 111–122). Springer Verlag. https://doi.org/10.1007/978-3-540-79561-2_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
