Optimizing parallel performance of streamline visualization for large distributed flow datasets

IEEE Pacific Visualisation Symposium 2008, PacificVis - Proceedings

Volumn , Issue , 2008, Pages 87-94

  Chen, Li ^a   Fujishiro, Issei ^b  

^a TSINGHUA UNIVERSITY   (China)

^b TOHOKU UNIVERSITY   (Japan)

Author keywords

Flow clustering; Flow visualization; Graph partition; Load balance; Parallel streamline

Indexed keywords

ADJACENT MATRIX; DATA-SETS; DIFFUSION OPERATORS; DISTRIBUTED FLOW; DISTRIBUTED-MEMORY COMPUTERS; EDGE WEIGHTS; FLOW CLUSTERING; FLOW DATA; FLOW DIRECTIONS; FLOW FEATURES; FLOW VISUALIZATION; FREQUENT COMMUNICATIONS; GRAPH BISECTION; GRAPH PARTITION; LOAD BALANCE; LOAD BALANCING; LOAD IMBALANCES; PARALLEL PERFORMANCE; PARALLEL STREAMLINE; STRONG COUPLINGS; UNSTRUCTURED FLOW; VISUALISATION; VORTEX STRUCTURES; WEAK COUPLINGS;

VISUALIZATION;

EID: 49749116840     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PACIFICVIS.2008.4475463     Document Type: Conference Paper

References (30)

1. S.-K. Ueng, C. Sikorski and K.-L. Ma. Out-of-Core streamline visualization on large unstructured meshes. IEEE TVCG, 3(4):370-380, 1997.
2. C.D. Hansen and P. Hinker. Massively parallel isosurface extraction. Proc. Visualization, pages 77-83, 1992.
3. C. M. Wittenbrink. Survey of parallel volume rendering algorithms. Proceedings of International Conference on Parallel distributed Processing Techniques and Applications, Las Vegas, Nevada, pages 1329-1336, 1998.
4. K. L. Ma, J. Painter, C. D. Hansen and M. F. Krogh. Parallel Volume Rendering Using Binary-swap Compositing. IEEE CG&A, Vol.14, No.4, pages 59-67, 1994.
5. W. J. Schroeder and C. R. Volpe, W. E. Lorensen. The stream polygon: a technique for 3d vector field visualization. Proc. Visualization 91, IEEE Computer Society Press, pages 126-132, 1991.
6. J. J. van Wijk. Flow visualization with surface particles. IEEE Computer Graphics and Applications, 13(4): 18-24, 1993.
7. B. Heckel, G. Weber, B. Hamann and K. I. Joy. Construction of vector field hierarchies. Proc. Visualization '99, IEEE Computer Society Press, pages 19-25, 1999.
8. A. C. Tclca and J. J. van Wijk. Simplified representation of vector fields. Proc. Visualization '99 IEEE CS Press, pages 35-42, 1999.
9. U. Diewald, T. Preußer and M. Rumpf. Anisotropic diffusion in vector field visualization on Euclidean domains and surfaces. IEEE TVCG, 6(2):139-149, 2000.
10. H. Garcke, T. Preusser, M. Rumpf, A. Telea, U. Weikard and J. J. van Wijk. A phase field model for continuous clustering on vector fields. IEEE TVCG, 7(3):230-241, 2000.
11. M. Griebel, T. Preusser, M. Rumpf, M. A. Schweitzer and A. Telea. Flow field clustering via algebraic multigrid. Proc. Visualization '04, IEEE Computer Society Press, 2004.
12. H.F. Yu, C.L. Wang and K-L. Ma. Parallel hierarchical visualization of large time-varying 3D vector fields. Proceedings of ACM/IEEE Supercomputing 2007 Conference, Reno, NV November, 2007.
13. J. Ebling and G. Scheuermann. Clifford convolution and pattern matching on vector fields". Proc. Visualization'03, pages 193-200, 2003.
14. H. Theisel and H. P. Seidel. Feature flow fields. Proc. EG/IEEE Vis-Sym '03, pages 141-148, 2003.
15. D. Bauer and R. Peikert. Vortex tracking in scale space. Proc. Visualization '02, pages 233-241, 2002.
16. J. Helman and L. Hesselink. Visualizing vector field topology in fluid flows. IEEE Computer Graphics and Applications, 11(3): 36-46, 1993.
17. H. D. Simon. Partitioning of unstructured problems for parallel processing, Computing Systems in Engineering, Vol. 2, pages 135-148, 1991.
18. M. Fiedler. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Mathematics Journal 25, pages 619-633, 1975.
19. B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. Report SAND93-1301, Sandia National Laboratories, Albuquerque, NM, 1993.
20. B.W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, Vol. 49, pages 291-308, 1970.
21. S. T. Barnard and H. D. Simon. Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience, Vol. 6, pages 101-117, 1994.
22. R. Van Driessche and D. Roose. A graph contraction algorithm for the fast calculation of the Fiedler vector of a graph. In Proc. 7th SIAM Conference on Parallel Processing for Scientific Computing, pages 621-626, 1995.
23. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. Report 95-035, University of Minnesota, Minneapolis, MN, 1995.
24. http://www.fsis.iis.u-tokyo.ac.jp/
25. http://www-users.cs.umn.edu/~karypis/metis/parmetis/
26. Earth Simulator Research and Development Center web site: http://www.es.jamstec.go.jp/
27. M.S. Chong, A.E. Perry, B.J. Cantwell. A general classification of 3D flow fields. Physics of Fluids Ann., Vol. 2, No.5, pages 765-777, 1990.
28. D. Sujudi and R. Haimes Identification of swirling flow in 3-D vector fields. AIAA-95-1715, 1995.
29. D. Kenwright. Automatic vortex core detection. IEEE Computer Graphics and Applications, Vol. 18, No. 4, pages 70-74, 1998.
30. M. Roth and R. Peikert. A higher-order method for finding vortex core lines. In: Proceedings of IEEE Visualization '98. ACM Press, New York, pages 143-150, 1998.