A survey of parallel particle tracing algorithms in flow visualization

Particle tracing is a very important method in flow field data visualization and analysis. By placing particle seeds in the flow domain and tracing the trajectory of each particle, users can explore and analyze the hidden local or global features in the flow field. However, particle tracing is computational complex and intensive. As the size and complexity of data continue to increase, tracing particles efficiently through parallel computing for flow field visualization and analysis becomes a popular trend in recent years. In this paper, we summarize the state-of-the-art researches on parallel particle tracing algorithms in flow visualization. According to the problems and challenges in the parallelization of particle tracing, methods are divided into three categories, including task parallelism, data parallelism, and hybrid methods that combine task and data parallelism. We show the pros and cons of these algorithms and their relationships for summarization. At the end of this survey, we also look into the research trends and discuss the remaining challenges for the possible future work.Graphical abstract

[1]  Philip J. Rhodes,et al.  Iteration aware prefetching for unstructured grids , 2013, 2013 IEEE International Conference on Big Data.

[2]  Brian Cabral,et al.  Imaging vector fields using line integral convolution , 1993, SIGGRAPH.

[3]  Xiaoru Yuan,et al.  Comparative visualization of vector field ensembles based on longest common subsequence , 2016, 2016 IEEE Pacific Visualization Symposium (PacificVis).

[4]  Christian H. Bischof,et al.  VIRACOCHA: An Efficient Parallelization Framework for Large-Scale CFD Post-Processing in Virtual Environments , 2004, Proceedings of the ACM/IEEE SC2004 Conference.

[5]  Min Chen,et al.  Over Two Decades of Integration‐Based, Geometric Flow Visualization , 2010, Comput. Graph. Forum.

[6]  Frank B. Schmuck,et al.  GPFS: A Shared-Disk File System for Large Computing Clusters , 2002, FAST.

[7]  Xuan Tang,et al.  Iteration Aware Prefetching for Large Multidimensional Datasets , 2005, SSDBM.

[8]  Lustre : A Scalable , High-Performance File System Cluster , 2003 .

[9]  Tom Peterka,et al.  Parallel particle advection and FTLE computation for time-varying flow fields , 2012, 2012 International Conference for High Performance Computing, Networking, Storage and Analysis.

[10]  Kwan-Liu Ma.  In situ visualization at extreme scale: challenges and opportunities. , 2009, IEEE computer graphics and applications.

[11]  Ümit V. Çatalyürek,et al.  Hypergraph-based Dynamic Load Balancing for Adaptive Scientific Computations , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[12]  Jian Huang,et al.  Simplified parallel domain traversal , 2011, 2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC).

[13]  G. Haller.  Distinguished material surfaces and coherent structures in three-dimensional fluid flows , 2001 .

[14]  Han-Wei Shen,et al.  Flow-guided file layout for out-of-core pathline computation , 2012, IEEE Symposium on Large Data Analysis and Visualization (LDAV).

[15]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[16]  Dmitriy Morozov,et al.  Efficient Delaunay Tessellation through K-D Tree Decomposition , 2016, SC16: International Conference for High Performance Computing, Networking, Storage and Analysis.

[17]  Jian Huang,et al.  Advection-Based Sparse Data Management for Visualizing Unsteady Flow , 2014, IEEE Transactions on Visualization and Computer Graphics.

[18]  Renato Pajarola,et al.  Out-Of-Core Algorithms for Scientific Visualization and Computer Graphics , 2002 .

[19]  Kwan-Liu Ma,et al.  Parallel hierarchical visualization of large time-varying 3D vector fields , 2007, Proceedings of the 2007 ACM/IEEE Conference on Supercomputing (SC '07).

[20]  Surendra Byna,et al.  Hiding I/O latency with pre-execution prefetching for parallel applications , 2008, 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis.

[21]  Lijie Xu,et al.  A flow-guided file layout for out-of-core streamline computation , 2011, 2012 IEEE Pacific Visualization Symposium.

[22]  Christoph Garth,et al.  Distributed parallel particle advection using work requesting , 2013, 2013 IEEE Symposium on Large-Scale Data Analysis and Visualization (LDAV).

[23]  David Ellsworth,et al.  Interactive terascale particle visualization , 2004, IEEE Visualization 2004.

[24]  Jian Huang,et al.  Scalable Lagrangian-Based Attribute Space Projection for Multivariate Unsteady Flow Data , 2014, 2014 IEEE Pacific Visualization Symposium.

[25]  Hans Hagen,et al.  Efficient Computation and Visualization of Coherent Structures in Fluid Flow Applications , 2007, IEEE Transactions on Visualization and Computer Graphics.

[26]  Xiaoru Yuan,et al.  Dynamic Load Balancing Based on Constrained K-D Tree Decomposition for Parallel Particle Tracing , 2018, IEEE Transactions on Visualization and Computer Graphics.

[27]  Robert B. Ross,et al.  PVFS: A Parallel File System for Linux Clusters , 2000, Annual Linux Showcase & Conference.

[28]  Sriram Krishnamoorthy,et al.  Scalable work stealing , 2009, Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis.

[29]  Xiaomin Zhu,et al.  Coupled Ensemble Flow Line Advection and Analysis , 2013, IEEE Transactions on Visualization and Computer Graphics.

[30]  Robert B. Ross,et al.  A Study of Parallel Particle Tracing for Steady-State and Time-Varying Flow Fields , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[31]  Gunther H. Weber,et al.  Scalable computation of streamlines on very large datasets , 2009, Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis.

[32]  John M. Dennis,et al.  Partitioning with space-filling curves on the cubed-sphere , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[33]  Bernd Hamann,et al.  Real-time out-of-core visualization of particle traces , 2001, Proceedings IEEE 2001 Symposium on Parallel and Large-Data Visualization and Graphics (Cat. No.01EX520).

[34]  Vipin Kumar,et al.  Parallel Multilevel k-way Partitioning Scheme for Irregular Graphs , 1996, Proceedings of the 1996 ACM/IEEE Conference on Supercomputing.

[35]  Robert S. Laramee,et al.  The State of the Art in Flow Visualisation: Feature Extraction and Tracking , 2003, Comput. Graph. Forum.

[36]  Kenneth I. Joy,et al.  Streamline Integration Using MPI-Hybrid Parallelism on a Large Multicore Architecture , 2011, IEEE Transactions on Visualization and Computer Graphics.

[37]  Fan Zhang,et al.  Combining in-situ and in-transit processing to enable extreme-scale scientific analysis , 2012, 2012 International Conference for High Performance Computing, Networking, Storage and Analysis.

[38]  Kenneth I. Joy,et al.  Parallel stream surface computation for large data sets , 2012, IEEE Symposium on Large Data Analysis and Visualization (LDAV).

[39]  Sanjay Ghemawat,et al.  MapReduce: simplified data processing on large clusters , 2008, CACM.

[40]  Surendra Byna,et al.  Parallel I/O prefetching using MPI file caching and I/O signatures , 2008, 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis.

[41]  Tom Peterka,et al.  Scalable Computation of Stream Surfaces on Large Scale Vector Fields , 2014, SC14: International Conference for High Performance Computing, Networking, Storage and Analysis.

[42]  Robert S. Laramee,et al.  Surface-based flow visualization , 2012, Comput. Graph..

[43]  Han-Wei Shen,et al.  Graph-based seed scheduling for out-of-core FTLE and pathline computation , 2013, 2013 IEEE Symposium on Large-Scale Data Analysis and Visualization (LDAV).

[44]  Robert S. Laramee,et al.  The State of the Art in Flow Visualization: Dense and Texture‐Based Techniques , 2004, Comput. Graph. Forum.

[45]  Ulrik Brandes,et al.  Eigensolver Methods for Progressive Multidimensional Scaling of Large Data , 2006, GD.

[46]  John C. Hart,et al.  Fast Coherent Particle Advection through Time-Varying Unstructured Flow Datasets , 2016, IEEE Transactions on Visualization and Computer Graphics.

[47]  Shahid H. Bokhari,et al.  A Partitioning Strategy for Nonuniform Problems on Multiprocessors , 1987, IEEE Transactions on Computers.

[48]  Hong-Ming Suen,et al.  Segmentation of uniform-coloured text from colour graphics background , 1997 .

[49]  Horst D. Simon,et al.  Partitioning of unstructured problems for parallel processing , 1991 .

[50]  David L. Kao,et al.  UFLIC: a line integral convolution algorithm for visualizing unsteady flows , 1997 .

[51]  Xiaoru Yuan,et al.  Efficient unsteady flow visualization with high-order access dependencies , 2016, 2016 IEEE Pacific Visualization Symposium (PacificVis).

[52]  Han-Wei Shen,et al.  Load-Balanced Parallel Streamline Generation on Large Scale Vector Fields , 2011, IEEE Transactions on Visualization and Computer Graphics.

[53]  Li Chen,et al.  Optimizing Parallel Performance of Streamline Visualization for Large Distributed Flow Datasets , 2008, 2008 IEEE Pacific Visualization Symposium.

[54]  Kenneth I. Joy,et al.  GPU Acceleration of Particle Advection Workloads in a Parallel, Distributed Memory Setting , 2013, EGPGV@Eurographics.