ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

tachyon: Efficient Shared Memory Parallel Computation of Extremum Graphs

Ande, A and Subhash, V and Natarajan, V (2023) tachyon: Efficient Shared Memory Parallel Computation of Extremum Graphs. In: Computer Graphics Forum .

com_gra_for_2023.pdf - Published Version

Download (16MB) | Preview
Official URL: https://doi.org/10.1111/cgf.14784


The extremum graph is a succinct representation of the Morse decomposition of a scalar field. It has increasingly become a useful data structure that supports topological feature-directed visualization of 2D/3D scalar fields, and enables dimensionality reduction together with exploratory analysis of high-dimensional scalar fields. Current methods that employ the extremum graph compute it either using a simple sequential algorithm for computing the Morse decomposition or by computing the more detailed Morse–Smale complex. Both approaches are typically limited to two and three-dimensional scalar fields. We describe a GPU–CPU hybrid parallel algorithm for computing the extremum graph of scalar fields in all dimensions. The proposed shared memory algorithm utilizes both fine-grained parallelism and task parallelism to achieve efficiency. An open source software library, tachyon, that implements the algorithm exhibits superior performance and good scaling behaviour. © 2023 Eurographics - The European Association for Computer Graphics and John Wiley & Sons Ltd.

Item Type: Journal Article
Publication: Computer Graphics Forum
Publisher: John Wiley and Sons Inc
Additional Information: The copyright for this article belongs to the Authors.
Keywords: Computation theory; Computational efficiency; Data visualization; Graphics processing unit; Memory architecture; Open source software; Open systems; Topology; Visualization, 3-D scalar; Critical point; Hybrid parallel algorithm; Morse decomposition; Morse the-ory; Parallel Computation; Scalar fields; Shared-memory parallels; Succinct representation; Topological features, Parallel algorithms
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 17 Mar 2023 09:44
Last Modified: 17 Mar 2023 09:44
URI: https://eprints.iisc.ac.in/id/eprint/81023

Actions (login required)

View Item View Item