Dmitriy Morozov
ABSTRACT
Improved simulations and sensors are producing datasets whose increasing complexity exhausts our ability to visualize and comprehend them directly. To cope with this problem, we can detect and extract significant features in the data and use them as the basis for subsequent analysis. Topological methods are valuable in this context because they provide robust and general feature definitions.
As the growth of serial computational power has stalled, data analysis is becoming increasingly dependent on massively parallel machines. To satisfy the computational demand created by complex datasets, algorithms need to effectively utilize these computer architectures. The main strength of topological methods, their emphasis on global information, turns into an obstacle during parallelization.
We present two approaches to alleviate this problem. We develop a distributed representation of the merge tree that avoids computing the global tree on a single processor and lets us parallelize subsequent queries. To account for the increasing number of cores per processor, we develop a new data structure that lets us take advantage of multiple shared-memory cores to parallelize the work on a single node. Finally, we present experiments that illustrate the strengths of our approach as well as help identify future challenges.
- D. Attali, M. Glisse, S. Hornus, F. Lazarus, and D. Morozov. Persistence-sensitive simplification of functions on surfaces in linear time, 2009. Manuscript, presented at the Workshop on Topology In Visualization (TopoInVis'09).Google Scholar
- U. Bauer, C. Lange, and M. Wardetzky. Optimal topological simplification of discrete functions on surfaces. Discrete and Computational Geometry, 47 (2): 347---377, 2012.Google ScholarDigital Library
- K. Beketayev, G. H. Weber, M. Haranczyk, P.-T. Bremer, M. Hlawitschka, and B. Hamann. Visualization of topology of transformation pathways in complex chemical systems. Computer Graphics Forum (EuroVis 2011), pages 663--672, May/June 2011. Google ScholarDigital Library
- P. Bendich, H. Edelsbrunner, D. Morozov, and A. Patel. Homology and robustness of level and interlevel sets. Homology, Homotopy, and Application, 2012. Accepted.Google Scholar
- P.-T. Bremer, G. H. Weber, V. Pascucci, M. S. Day, and J. B. Bell. Analyzing and tracking burning structures in lean premixed hydrogen flames. IEEE Transactions on Visualization and Computer Graphics, 16 (2): 248--260, 2010. doi:10.1109/TVCG.2009.69. Google ScholarDigital Library
- P.-T. Bremer, G. H. Weber, J. Tierny, V. Pascucci, M. S. Day, and J. B. Bell. Interactive exploration and analysis of large scale simulations using topology-based data segmentation. IEEE Transactions on Visualization and Computer Graphics, 17 (9): 1307--1325, 2011. Google ScholarDigital Library
- H. Carr and J. Snoeyink. Path seeds and flexible isosurfaces using topology for exploratory visualization. In Data Visualization 2003 (Proceedings VisSym 2003), pages 49--58, New York, NY, 2003. Google ScholarDigital Library
- H. Carr, J. Snoeyink, and U. Axen. Computing contour trees in all dimensions. Computational Geometry-Theory and Applications, 24 (2): 75--94, 2003. Google ScholarDigital Library
- H. Carr, J. Snoeyink, and M. van de Panne. Simplifying flexible isosurfaces using local geometric measures. In Proceedings IEEE Visualization 2004, pages 497--504, Oct. 2004. http://dx.doi.org/10.1109/VISUAL.2004.96. Google ScholarDigital Library
- H. Edelsbrunner and J. Harer. Persistent homology--a survey, volume 453 of Contemporary Mathematics, pages 257--282. American Mathematical Society, 2008.Google Scholar
- H. Edelsbrunner and J. Harer. Computational Topology. An Introduction. American Mathematical Society, Providence, Rhode Island, 2010.Google Scholar
- H. Edelsbrunner, D. Morozov, and V. Pascucci. Persistence-sensitive simplification of functions on 2-manifolds. In Proceedings of the Symposium on Computational Geometry, pages 127--134, 2006. Google ScholarDigital Library
- A. Gyulassy, V. Pascucci, T. Peterka, and R. Ross. The parallel computation of Morse--Smale complexes. In Parallel & Distributed Processing Symposium (IPDPS), pages 484--495, 2012. Google ScholarDigital Library
- D. Laney, P.-T. Bremer, A. Macarenhas, P. Miller, and V. Pascucci. Understanding the structure of the turbulent mixing layer in hydrodynamic instabilities. IEEE Transactions on Visualization and Computer Graphics, 12 (6): 1053--1060, 2006. Google ScholarDigital Library
- A. Mascarenhas, R. Grout, P.-T. Bremer, V. Pascucci, E. Hawkes, and J. Chen. Topological feature extraction for comparison of length scales in terascale combustion simulation data. In V. Pascucci, X. Tricoche, H. Hagen, and J. Tierny, editors, Topological Methods in Data Analysis and Visualization: Theory, Algorithms, and Applications, pages 229--240, 2011.Google Scholar
- D. Morozov and G. Weber. Distributed contour trees. Manuscript, 2012.Google Scholar
- V. Pascucci and K. Cole-McLaughlin. Parallel computation of the topology of level sets. Algorithmica, 38 (1): 249--268, 2003. 10.1007/s00453-003-1052-3. Google ScholarDigital Library
- V. Pascucci, K. Cole-McLaughlin, and G. Scorzelli. The Toporrery: Computation and Presentation of Multi-Resolution Topology, pages 19--40. Springer-Verlag, 2009.Google Scholar
- W. Pugh. Skip lists: a probabilistic alternative to balanced trees. Communications of the ACM, 33 (6): 668---676, 1990. Google ScholarDigital Library
- G. Reeb. Sur les points singuliers d'une forme de pfaff complètement intégrable ou d'une fonction numérique. Comptes Rendus de l'Acadèmie des Sciences de Paris, 222: 847--849, 1946.Google Scholar
- N. Shivashankar and V. Natarajan. Parallel computation of 3d Morse-Smale complexes. Computer Graphics Forum (EuroVis 2012), 31 (3): 965--974, 2012. Google ScholarDigital Library
- N. Shivashankar, Senthilnathan M., and V. Natarajan. Parallel computation of 2d Morse-Smale complexes. IEEE Transactions on Visualization and Computer Graphics, 2012. To appear. Google ScholarDigital Library
- G. H. Weber, P.-T. Bremer, M. S. Day, J. B. Bell, and V. Pascucci. Feature tracking using reeb graphs. In V. Pascucci, X. Tricoche, H. Hagen, and J. Tierny, editors, Topological Methods in Data Analysis and Visualization: Theory, Algorithms, and Applications, pages 241--253, 2011.Google Scholar
Index Terms
- Distributed merge trees
Recommendations
Distributed merge trees
PPoPP '13Improved simulations and sensors are producing datasets whose increasing complexity exhausts our ability to visualize and comprehend them directly. To cope with this problem, we can detect and extract significant features in the data and use them as the ...
Dual-level parallelism for ab initio molecular dynamics: Reaching teraflop performance with the CPMD code
We show teraflop performance of the fully featured ab initio molecular dynamics code CPMD on an IBM pSeries 690 cluster. A mixed distributed-memory, coarse-grained parallel approach using the MPI library and shared-memory, fine-grained parallelism using ...
Load-Balanced Parallel Merge Sort on Distributed Memory Parallel Computers
IPDPS '02: Proceedings of the 16th International Parallel and Distributed Processing SymposiumSort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implemented on distributed memory computers has poor performance due to the ...
Comments