A Study of Parallel Particle Tracing for Steady-State and Time-Varying Flow Fields

• Published in: 2011 IEEE International Parallel & Distributed Processing Symposium pp. 580 - 591
• Main Authors: Peterka, T., Ross, R., Nouanesengsy, B., Teng-Yok Lee, Han-Wei Shen, Kendall, W., Jian Huang
• Format: Conference Proceeding
• Language: English; Japanese
• Published: IEEE 01.05.2011
• Subjects: Data structures; Heuristic algorithms; Libraries; Load management; Partitioning algorithms; Rendering (computer graphics); Steady-state
• ISBN: 1612843727; 9781612843728
• ISSN: 1530-2075
• DOI: 10.1109/IPDPS.2011.62

Particle tracing for streamline and path line generation is a common method of visualizing vector fields in scientific data, but it is difficult to parallelize efficiently because of demanding and widely varying computational and communication loads. In this paper we scale parallel particle tracing for visualizing steady and unsteady flow fields well beyond previously published results. We configure the 4D domain decomposition into spatial and temporal blocks that combine in-core and out-of-core execution in a flexible way that favors faster run time or smaller memory. We also compare static and dynamic partitioning approaches. Strong and weak scaling curves are presented for tests conducted on an IBM Blue Gene/P machine at up to 32 K processes using a parallel flow visualization library that we are developing. Datasets are derived from computational fluid dynamics simulations of thermal hydraulics, liquid mixing, and combustion.