返回
A two-level multithreaded Delaunay kernel
DOI:10.1016/j.cad.2016.07.018.png)
摘要
En 中文
This paper presents a fine grain parallel version of the 3D Delaunay Kernel procedure using the OpenMP (Open Multi-Processing) API. A set S = {p(1),. . . ,p(n)} of n points is taken as input. S is initially sorted along a space-filling curve so that two points that are close in the insertion order are also close geometrically. The sorted set of points is then divided into M subsets S-i, 1 <= i <= M of equal size n/M. The multithreaded version of the Delaunay kernel inserts M points at a time in the triangulation, OpenMP barriers provide the required synchronization that is needed after each multiple insertion in order to avoid data races. This simple approach exhibits two standard problems of parallel computing: load imbalance and parallel overheads. Those two issues are addressed using a two-level version of the multithreaded Delaunay kernel. Tests show that triangulations of about a billion tetrahedra can be generated on a 32 core machine (Intel Xeon E5-4610 v2 @ 2.30 GHz with 128 GB of memory) in less that 3 minutes of wall clock time, with a speedup of 18 compared to the single-threaded implementation. (C) 2016 Published by Elsevier Ltd.
Keyword:
Delaunay triangulation
Parallel computing
OpenMP
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.1
论文数:
3.1K
被引数:
6.4K
机构
引用论文
Turbocharger motor-generator for improvement of transient performance in an internal combustion engine用于改善内燃机瞬态性能的涡轮增压器电动发电机
Wide Diversity in Measurements of Growth Hormone after Stimulation Tests in Short Children are Due to Assay Variability矮小儿童刺激试验后生长激素的测量差异很大
没有更多内容

