A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Comparison of OpenMP 3.0 and Other Task Parallel Frameworks on Unbalanced Task Graphs
2010
International journal of parallel programming
The UTS benchmark is used to evaluate the expression and performance of task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of an irregular and unpredictable search space, as arises, e.g., in combinatorial optimization problems. As such UTS presents a highly unbalanced task graph that challenges scheduling, load balancing, termination detection, and task coarsening strategies. Expressiveness and scalability
doi:10.1007/s10766-010-0140-7
fatcat:o2uabh7pe5hudla5wjw6acogje