Back to Search Start Over

The Parallel Computation of Morse-Smale Complexes.

The Parallel Computation of Morse-Smale Complexes.

Authors :
Gyulassy, Attila
Pascucci, Valerio
Peterka, Tom
Ross, Robert
Source :
2012 IEEE 26th International Parallel & Distributed Processing Symposium; 1/ 1/2012, p484-495, 12p
Publication Year :
2012

Abstract

Topology-based techniques are useful for multiscale exploration of the feature space of scalar-valued functions, such as those derived from the output of large-scale simulations. The Morse-Smale (MS) complex, in particular, allows robust identification of gradient-based features, and therefore is suitable for analysis tasks in a wide range of application domains. In this paper, we develop a two-stage algorithm to construct the 1-skeleton of the Morse-Smale complex in parallel, the first stage independently computing local features per block and the second stage merging to resolve global features. Our implementation is based on MPI and a distributed-memory architecture. Through a set of scalability studies on the IBM Blue Gene/P supercomputer, we characterize the performance of the algorithm as block sizes, process counts, merging strategy, and levels of topological simplification are varied, for datasets that vary in feature composition and size. We conclude with a strong scaling study using scientific datasets computed by combustion and hydrodynamics simulations. [ABSTRACT FROM PUBLISHER]

Details

Language :
English
ISBNs :
9781467309752
Database :
Complementary Index
Journal :
2012 IEEE 26th International Parallel & Distributed Processing Symposium
Publication Type :
Conference
Accession number :
86539774
Full Text :
https://doi.org/10.1109/IPDPS.2012.52