Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2409.03771 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909307309654016 |
|---|---|
| author | Will, Michael Lukasczyk, Jonas Tierny, Julien Garth, Christoph |
| author_facet | Will, Michael Lukasczyk, Jonas Tierny, Julien Garth, Christoph |
| contents | This paper describes the adaptation of a well-scaling parallel algorithm for computing Morse-Smale segmentations based on path compression to a distributed computational setting. Additionally, we extend the algorithm to efficiently compute connected components in distributed structured and unstructured grids, based either on the connectivity of the underlying mesh or a feature mask. Our implementation is seamlessly integrated with the distributed extension of the Topology ToolKit (TTK), ensuring robust performance and scalability. To demonstrate the practicality and efficiency of our algorithms, we conducted a series of scaling experiments on large-scale datasets, with sizes of up to 4096^3 vertices on up to 64 nodes and 768 cores. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_03771 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Distributed Path Compression for Piecewise Linear Morse-Smale Segmentations and Connected Components Will, Michael Lukasczyk, Jonas Tierny, Julien Garth, Christoph Distributed, Parallel, and Cluster Computing This paper describes the adaptation of a well-scaling parallel algorithm for computing Morse-Smale segmentations based on path compression to a distributed computational setting. Additionally, we extend the algorithm to efficiently compute connected components in distributed structured and unstructured grids, based either on the connectivity of the underlying mesh or a feature mask. Our implementation is seamlessly integrated with the distributed extension of the Topology ToolKit (TTK), ensuring robust performance and scalability. To demonstrate the practicality and efficiency of our algorithms, we conducted a series of scaling experiments on large-scale datasets, with sizes of up to 4096^3 vertices on up to 64 nodes and 768 cores. |
| title | Distributed Path Compression for Piecewise Linear Morse-Smale Segmentations and Connected Components |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2409.03771 |