Abstract
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













Similar content being viewed by others
References
Akande OO, Rhodes PJ (2013) Iteration aware prefetching for unstructured grids. In: Proceedings of the 2013 IEEE international conference on big data. pp 219–227
Bennett J, Abbasi H, Bremer P, Grout RW, Gyulassy A, Jin T, Klasky S, Kolla H, Parashar M, Pascucci V, Pébay PP, Thompson DC, Yu H, Zhang F, Chen J (2012) Combining in-situ and in-transit processing to enable extreme-scale scientific analysis. In: SC12: Proceedings of the ACM/IEEE Conference on Supercomputing. p 49
Berger MJ, Bokhari SH (1987) A partitioning strategy for nonuniform problems on multiprocessors. IEEE Trans Comput 36(5):570–580
Blumofe RD (1994) Scheduling multithreaded computations by work stealing. In: 35th annual symposium on foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994. pp 356–368
Brandes U, Pich C (2006) Eigensolver methods for progressive multidimensional scaling of large data. In: Graph drawing(14th international symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised papers. pp 42–53
Bruckschen R, Kuester F, Hamann B, Joy KI (2001) Real-time out-of-core visualization of particle traces. In: Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics. pp 45–50
Byna S, Chen Y, Sun X, Thakur R, Gropp W (2008) Parallel I/O prefetching using MPI file caching and I/O signatures. In: SC08: Proceedings of the ACM/IEEE conference on supercomputing. pp 1–12
Cabral B, Leedom LC (1993) Imaging vector fields using line integral convolution. Proc SIGGRAPH 1993:263–270
Camp D, Garth C, Childs H, Pugmire D, Joy KI (2011) Streamline integration using MPI-hybrid parallelism on a large multicore architecture. IEEE Trans Vis Comput Gr 17(11):1702–1713
Camp D, Garth C, Childs H, Pugmire D, Joy KI (2012) Parallel stream surface computation for large data sets. Proc IEEE Symp Large Data Anal Vis 2012:39–47
Camp D, Krishnan H, Pugmire D, Garth C, Johnson I, Bethel EW, Joy KI, Childs H (2013) GPU acceleration of particle advection workloads in a parallel, distributed memory setting. In: EGPGV13: eurographics symposium on parallel graphics and visualization. pp 1–8
Carns PH, III, WBL, Ross RB, Thakur R (2000) PVFS: A parallel file system for linux clusters. In: 4th annual Linux showcase & conference 2000
Çatalyürek ÜV, Boman EG, Devine KD, Bozdag D, Heaphy RT, Riesen LA (2007) Hypergraph-based dynamic load balancing for adaptive scientific computations. In: IPDPS07: Proceedings of IEEE international symposium on parallel and distributed processing. pp 1–11
Chen C, Nouanesengsy B, Lee T, Shen H (2012) Flow-guided file layout for out-of-core pathline computation. Proc IEEE Symp Large Data Anal Vis 2012:109–112
Chen C, Shen H (2013) Graph-based seed scheduling for out-of-core FTLE and pathline computation. Proc IEEE Symp Large Data Anal Vis 2013:15–23
Chen C, Xu L, Lee T, Shen H (2012) A flow-guided file layout for out-of-core streamline computation. Proc IEEE Pacific Vis Symp 2012:145–152
Chen L, Fujishiro I (2008) Optimizing parallel performance of streamline visualization for large distributed flow datasets. Proc IEEE Pac Vis Symp 2008:87–94
Chen M, Shadden SC, Hart JC (2016) Fast coherent particle advection through time-varying unstructured flow datasets. IEEE Trans Vis Comput Gr 22(8):1959–1972
Chen Y, Byna S, Sun X, Thakur R, Gropp W (2008) Hiding I/O latency with pre-execution prefetching for parallel applications. In: SC08: proceedings of the ACM/IEEE conference on supercomputing. pp 1–10
Dinan J, Larkins DB, Sadayappan P, Krishnamoorthy S, Nieplocha J (2009). Scalable work stealing. In: SC09: proceedings of the ACM/IEEE conference on supercomputing. pp 1–11
Edmunds M, Laramee RS, Chen G, Max N, Zhang E, Ware C (2012) Surface-based flow visualization. Comput Gr 36(8):974–990
Ellsworth D, Green B, Moran PJ (2004) Interactive terascale particle visualization. Proc IEEE Vis 2004:353–360
Garth C, Gerhardt F, Tricoche X, Hagen H (2007) Efficient computation and visualization of coherent structures in fluid flow applications. IEEE Comput Gr Appl 13(6):1464–1471
Gerndt A, Hentschel B, Wolter M, Kuhlen T, Bischof CH (2004) VIRACOCHA: an efficient parallelization framework for large-scale CFD post-processing in virtual environments. In: SC04: proceedings of the ACM/IEEE Conference on Supercomputing. p 50
Guo H, Hong F, Shu Q, Zhang J, Huang J, Yuan X (2014) Scalable lagrangian-based attribute space projection for multivariate unsteady flow data. Proc IEEE Pac Vis Symp 2014:33–40
Guo H, Yuan X, Huang J, Zhu X (2013) Coupled ensemble flow line advection and analysis. IEEE Trans Vis Comput Gr 19(12):2733–2742
Guo H, Zhang J, Liu R, Liu L, Yuan X, Huang J, Meng X, Pan J (2014b) Advection-based sparse data management for visualizing unsteady flow. IEEE Trans Vis Comput Gr 20(12):2555–2564
Haller G (2001) Distinguished material surfaces and coherent structures in three-dimensional fluid flows. Phys D Nonlinear Phenom 149(4):248–277
Inc. CFS (2002) Lustre: a scalable, high performance file system. whitepaper
Jeffrey D, Sanjay G (2008) Mapreduce: simplified data processing on large clusters. Commun ACM 51(1):107–113
Karypis G, Kumar V (1996) Parallel multilevel k-way partitioning scheme for irregular graphs. In: SC96: proceedings of the ACM/IEEE conference on supercomputing. Washington, DC, USA, IEEE Computer Society, p 35
Kendall W, Wang J, Allen M, Peterka T, Huang J, Erickson D (2011) Simplified parallel domain traversal. In: SC11: proceedings of the ACM/IEEE conference on supercomputing. pp 1–11
Laramee R, Hauser H, Doleisch H, Vrolijk B, Post F, Weiskopf D (2004) The state of the art in flow visualization: dense and texture-based techniques. Comput Gr Forum 23(2):203–222
Liu R, Guo H, Zhang J, Yuan X (2016) Comparative visualization of vector field ensembles based on longest common subsequence. Proc IEEE Pac Vis Symp 2016:96–103
Lu K, Shen H, Peterka T (2014) Scalable computation of stream surfaces on large scale vector fields. In: SC14: proceedings of the ACM/IEEE conference on supercomputing pp 1008–1019
Ma K (2009) In situ visualization at extreme scale: challenges and opportunities. IEEE Comput Gr Appl 29(6):14–19
McLoughlin T, Laramee R, Peikert R, Post F, Chen M (2010) Over two decades of integration-based, geometric flow visualization. Comput Gr Forum 29(6):1807–1829
Morozov D Peterka T (2016) Efficient delaunay tessellation through K-D tree decomposition. In: SC’16: proceedings of the international conference for high performance computing, networking, storage and analysis. pp 728–738
Müller C, Camp D, Hentschel B, Garth C (2013) Distributed parallel particle advection using work requesting. Proc IEEE Symp Large Data Anal Vis 2013:1–6
Nouanesengsy B, Lee T, Lu K, Shen H, Peterka T (2012) Parallel particle advection and FTLE computation for time-varying flow fields. In: SC12: proceedings of the ACM/IEEE conference on supercomputing. pp 1–11
Nouanesengsy B, Lee T, Shen H (2011) Load-balanced parallel streamline generation on large scale vector fields. IEEE Trans Vis Comput Gr 17(12):1785–1794
Peterka T, Ross RB, Nouanesengsy B, Lee T, Shen H, Kendall W, Huang J (2011) A study of parallel particle tracing for steady-state and time-varying flow fields. In: IPDPS11: proceedings of IEEE international symposium on parallel and distributed processing. pp 580–591
Pilkington JR Baden SB (1994) Partitioning with space-filling curves. In: CSE technical report number CS94-349
Post F, Vrolijk B, Hauser H, Laramee R, Doleisch H (2003) The state of the art in flow visualisation: feature extraction and tracking. Comput Gr Forum 22(4):1–17
Pugmire D, Childs H, Garth C, Ahern S, Weber GH(2009) Scalable computation of streamlines on very large datasets. In: SC09: proceedings of the ACM/IEEE conference on supercomputing. pp 1–12
Rhodes PJ, Tang X, Bergeron RD, Sparr TM (2005) Iteration aware prefetching for large multidimensional datasets. In: SSDBM2005: proceedings of the 17th international conference on scientific and statistical database management. pp 45–54
Schmuck FB Haskin RL (2002) GPFS: a shared-disk file system for large computing clusters. In: proceedings of the FAST ’02 conference on file and storage technologies. pp 231–244
Shen H-W, Kao DL (1997) UFLIC: a line integral convolution algorithm for visualizing unsteady flows. Proc IEEE Vis 1997:317–322
Silva C, Chiang Y-J, El-Sana J, Lindstrom P (2002) Out-of-core algorithms for scientific visualization and computer graphics. IEEE visualization course notes
Simon HD (1991) Partitioning of unstructured problems for parallel processing. Comput Syst Eng 2(2–3):135–148
Yu H, Wang C, Ma K (2007) Parallel hierarchical visualization of large time-varying 3D vector fields. In: SC07: proceedings of the ACM/IEEE conference on supercomputing. pp 1–12
Zhang J, Guo H, Hong F, Yuan X, Peterka T (2018) Dynamic load balancing based on constrained k-d tree decomposition for parallel particle tracing. IEEE Trans Vis Comput Gr 24(1):954–963
Zhang J, Guo H, Yuan X (2016) Efficient unsteady flow visualization with high-order access dependencies. Proc IEEE Pac Vis Symp 80:87
Acknowledgements
This work is supported by NSFC No. 61672055 and the National Program on Key Basic Research Project (973 Program) No. 2015CB352503.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, J., Yuan, X. A survey of parallel particle tracing algorithms in flow visualization. J Vis 21, 351–368 (2018). https://doi.org/10.1007/s12650-017-0470-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12650-017-0470-2