Abstract
Writing irregular parallel algorithms with OpenMP has been rarely practised in the past. Yet it is possible, and in this paper we will use a simple breadth-first search application as an example to show a possible stepping stone and deficiency of the OpenMP specification: It is very difficult to cancel the threads in a parallel region. A way to work around the issue within the existing OpenMP specification is sketched, while our main contribution is a proposal for an extension of OpenMP to solve the issue in an easier way. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Süß, M., & Leopold, C. (2006). Implementing irregular parallel algorithms with OpenMP what’s missing and how to solve it. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4128 LNCS, pp. 635–644). Springer Verlag. https://doi.org/10.1007/11823285_66
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
