We describe using OpenMP to compute δ-hyperbolicity, a quantity of interest in social and information network analysis, at a scale that uses up to 1000 threads. By considering both OpenMP workshare and tasking models to parallelize the computations, we find that multiple task levels permits finer grained tasks at runtime and results in better performance at scale than worksharing constructs. We also characterize effects of task inflation, load balancing, and scheduling overhead in this application, using both GNU and Intel compilers. Finally, we show how OpenMP 3.1 tasking clauses can be used to mitigate overheads at scale. © 2013 Springer-Verlag.
CITATION STYLE
Adcock, A. B., Sullivan, B. D., Hernandez, O. R., & Mahoney, M. W. (2013). Evaluating OpenMP tasking at scale for the computation of graph hyperbolicity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8122 LNCS, pp. 71–83). https://doi.org/10.1007/978-3-642-40698-0_6
Mendeley helps you to discover research relevant for your work.