|
|
|
|
| LEADER |
01000caa a22002652 4500 |
| 001 |
NLM371196612 |
| 003 |
DE-627 |
| 005 |
20240703232751.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
240418s2024 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TVCG.2024.3390219
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n1458.xml
|
| 035 |
|
|
|a (DE-627)NLM371196612
|
| 035 |
|
|
|a (NLM)38630564
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Le Guillou, Eve
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a TTK is Getting MPI-Ready
|
| 264 |
|
1 |
|c 2024
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Revised 01.07.2024
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a This system paper documents the technical foundations for the extension of the Topology ToolKit (TTK) to distributed-memory parallelism with the Message Passing Interface (MPI). While several recent papers introduced topology-based approaches for distributed-memory environments, these were reporting experiments obtained with tailored, mono-algorithm implementations. In contrast, we describe in this paper a versatile approach (supporting both triangulated domains and regular grids) for the support of topological analysis pipelines, i.e., a sequence of topological algorithms interacting together, possibly on distinct numbers of processes. While developing this extension, we faced several algorithmic and software engineering challenges, which we document in this paper. Specifically, we describe an MPI extension of TTK's data structure for triangulation representation and traversal, a central component to the global performance and generality of TTK's topological implementations. We also introduce an intermediate interface between TTK and MPI, both at the global pipeline level, and at the fine-grain algorithmic level. We provide a taxonomy for the distributed-memory topological algorithms supported by TTK, depending on their communication needs and provide examples of hybrid MPI+thread parallelizations. Detailed performance analyses show that parallel efficiencies range from 20% to 80% (depending on the algorithms), and that the MPI-specific preconditioning introduced by our framework induces a negligible computation time overhead. We illustrate the new distributed-memory capabilities of TTK with an example of advanced analysis pipeline, combining multiple algorithms, run on the largest publicly available dataset we have found (120 billion vertices) on a standard cluster with 64 nodes (for a total of 1536 cores). Finally, we provide a roadmap for the completion of TTK's MPI extension, along with generic recommendations for each algorithm communication category
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Will, Michael
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Guillou, Pierre
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Lukasczyk, Jonas
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Fortin, Pierre
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Garth, Christoph
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Tierny, Julien
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on visualization and computer graphics
|d 1996
|g 30(2024), 8 vom: 16. Juli, Seite 5875-5892
|w (DE-627)NLM098269445
|x 1941-0506
|7 nnns
|
| 773 |
1 |
8 |
|g volume:30
|g year:2024
|g number:8
|g day:16
|g month:07
|g pages:5875-5892
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TVCG.2024.3390219
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 30
|j 2024
|e 8
|b 16
|c 07
|h 5875-5892
|