Parallel particle advection and FTLE computation for time-varying flow fields

Authors:
Boonthanome Nouanesengsy;Teng-Yok Lee;Kewei Lu;Han-Wei Shen;Tom Peterka
Affiliations:
The Ohio State University, Columbus, OH;The Ohio State University, Columbus, OH;The Ohio State University, Columbus, OH;The Ohio State University, Columbus, OH;Argonne National Laboratory, Argonne, IL
Venue:
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Year:
2012

Citing 19
Cited 0

Distinguished material surfaces and coherent structures in three-dimensional fluid flows

Physica D
Real-time out-of-core visualization of particle traces

PVG '01 Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics
A Parallel Pipelined Renderer for Time-Varying Volume Data

ISPAN '97 Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks
Interactive Terascale Particle Visualization

VIS '04 Proceedings of the conference on Visualization '04
Comparison of four parallel algorithms for domain decomposed implicit Monte Carlo

Journal of Computational Physics
Streamline Predicates

IEEE Transactions on Visualization and Computer Graphics
Efficient Computation and Visualization of Coherent Structures in Fluid Flow Applications

IEEE Transactions on Visualization and Computer Graphics
Parallel hierarchical visualization of large time-varying 3D vector fields

Proceedings of the 2007 ACM/IEEE conference on Supercomputing
Pathline predicates and unsteady flow structures

The Visual Computer: International Journal of Computer Graphics
An efficient, robust, domain-decomposition algorithm for particle Monte Carlo

Journal of Computational Physics
Terascale data organization for discovering multivariate climatic trends

Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Scalable computation of streamlines on very large datasets

Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Interactive Separating Streak Surfaces

IEEE Transactions on Visualization and Computer Graphics
Streamline Integration Using MPI-Hybrid Parallelism on a Large Multicore Architecture

IEEE Transactions on Visualization and Computer Graphics
A Study of Parallel Particle Tracing for Steady-State and Time-Varying Flow Fields

IPDPS '11 Proceedings of the 2011 IEEE International Parallel & Distributed Processing Symposium
Simplified parallel domain traversal

Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
Load-Balanced Parallel Streamline Generation on Large Scale Vector Fields

IEEE Transactions on Visualization and Computer Graphics
GPU and APU computations of Finite Time Lyapunov Exponent fields

Journal of Computational Physics
A statistics-based dimension reduction of the space of path line attributes for interactive visual flow analysis

PACIFICVIS '12 Proceedings of the 2012 IEEE Pacific Visualization Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

Flow fields are an important product of scientific simulations. One popular flow visualization technique is particle advection, in which seeds are traced through the flow field. One use of these traces is to compute a powerful analysis tool called the Finite-Time Lyapunov Exponent (FTLE) field, but no existing particle tracing algorithms scale to the particle injection frequency required for high-resolution FTLE analysis. In this paper, a framework to trace the massive number of particles necessary for FTLE computation is presented. A new approach is explored, in which processes are divided into groups, and are responsible for mutually exclusive spans of time. This pipelining over time intervals reduces overall idle time of processes and decreases I/O overhead. Our parallel FTLE framework is capable of advecting hundreds of millions of particles at once, with performance scaling up to tens of thousands of processes.