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

A Hybrid Parallel Algorithm for Computing and Tracking Level Set Topology

Maadasamy, Senthilnathan and Doraiswamy, Harish and Natarajan, Vijay (2012) A Hybrid Parallel Algorithm for Computing and Tracking Level Set Topology. In: 19th International Conference on High Performance Computing (HiPC), DEC 18-22, 2012, Pune, INDIA.

[img]
Preview
PDF
harish_hybrid.pdf - Published Version

Download (1843Kb) | Preview
Official URL: http://hgpu.org/?p=8288

Abstract

The contour tree is a topological abstraction of a scalar field that captures evolution in level set connectivity. It is an effective representation for visual exploration and analysis of scientific data. We describe a work-efficient, output sensitive, and scalable parallel algorithm for computing the contour tree of a scalar field defined on a domain that is represented using either an unstructured mesh or a structured grid. A hybrid implementation of the algorithm using the GPU and multi-core CPU can compute the contour tree of an input containing 16 million vertices in less than ten seconds with a speedup factor of upto 13. Experiments based on an implementation in a multi-core CPU environment show near-linear speedup for large data sets.

Item Type: Conference Proceedings
Related URLs:
Additional Information: 19th International Conference on High Performance Computing (HiPC), Pune, INDIA, DEC 18-22, 2012
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 27 Sep 2013 08:13
Last Modified: 27 Sep 2013 08:14
URI: http://eprints.iisc.ernet.in/id/eprint/47334

Actions (login required)

View Item View Item