Name
Abstract | ||
|---|---|---|
We present a data-parallel algorithm for identifying and labeling the connected sub-meshes within a domaindecomposed 3D mesh. The identification task is challenging in a distributed-memory parallel setting because connectivity is transitive and the cells composing each sub-mesh may span many or all processors. Our algorithm employs a multi-stage application of the Union-find algorithm and a spatial partitioning scheme to efficiently merge information across processors and produce a global labeling of connected sub-meshes. Marking each vertex with its corresponding sub-mesh label allows us to isolate mesh features based on topology, enabling new analysis capabilities. We briefly discuss two specific applications of the algorithm and present results from a weak scaling study. We demonstrate the algorithm at concurrency levels up to 2197 cores and analyze meshes containing up to 68 billion cells. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.2312/EGPGV/EGPGV11/131-140 | eurographics workshop on parallel graphics and visualization |
Keywords | DocType | Citations |
billion cell,data-parallel algorithm,identification task,connected sub-meshes,present result,distributed-memory parallel setting,concurrency level,multi-stage application,data-parallel mesh,union-find algorithm,corresponding sub-mesh label,parallel processing,distributed memory,algorithms,connected component,spatial partitioning,topology | Conference | 6 |
PageRank | References | Authors |
0.54 | 19 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| cyrus harrison | 1 | 6 | 0.54 |
| H. Childs | 2 | 92 | 5.16 |
| K. P. Gaither | 3 | 6 | 0.54 |