JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Performance Analysis of a Parallel Mesh Smoothing Algorithm using Graph Coloring and OpenMP
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Performance Analysis of a Parallel Mesh Smoothing Algorithm using Graph Coloring and OpenMP
Shin, Myeonggyu; Kim, Jibum;
  PDF(new window)
 Abstract
We propose a parallel mesh smoothing algorithm using graph coloring and OpenMP library for shared memory many core computer architectures. The proposed algorithm partitions a mesh into independent sets and performs a parallel mesh smoothing using OpenMP library. We study the effect of using various graph coloring and color reordering algorithms on the efficiency of performing the proposed parallel mesh smoothing algorithm. We also investigate the influence of using various OpenMP loop scheduling methods on the parallel mesh smoothing efficiency.
 Keywords
OpenMP;
 Language
Korean
 Cited by
 References
1.
J.R. Shewchuk., "What is a good linear element? Interpolation, conditioning, and quality measures," in Proc. of the 11th International Meshing Roundtable, Sandia National Laboratories, pp. 115-126. 2002.

2.
S.P. Sastry and S.M. Shontz, "A parallel log-barrier method for mesh quality improvement and untangling," Engineering with Computers, Vol. 30, no. 4, pp. 503-515, 2014. crossref(new window)

3.
G. Gorman, J. Southern, P. Farrell, M. Piggott ,G. Rokos, P. ,Kelly, "Hybrid OpenMP/MPI anisotropic mesh smoothing. in Proc. of the international conference on computational science," procedia computer science, vol 9. pp 1513-1522, 2012. crossref(new window)

4.
X. Jiao and P.J. Alexader, "Parallel feature-preserving mesh smoothing, in Proc. of International Conference on Computational Science," pp. 1180-1189, 2005.

5.
L. Freitag, J.M. Plassmann P, "A parallel algorithm for mesh smoothing," SIAM J. Sci Comput. Vol. 20, no. 6, pp. 2023-2040, 1999. crossref(new window)

6.
D. Benitez, E. Rodriguez, J.M. Escobar, R. Montenegro, "Performance evaluation of a parallel algorithm for simultaneous untangling and smoothing of tetrahedral meshes," in Proc. of the 22nd international meshing roundtable. Springer International Publishing, pp. 579-598, 2013.

7.
J. R. Allwright, R. Bordawekar, P. D. Coddington, K. Dincer, and C. L. Martin, "A comparison of parallel graph coloring algorithms," Technical report, SCCS-666, Northeast Parallel Architectures Center at Syracuse University, 1995.

8.
Chundoong Supercomputer, Center for Manycore Programming, Seoul National University, 2016.

9.
OpneMP Architecture Review Board, OpenMP API, http://www.openmp.org/.

10.
S.M. Shontz and P.M. Knupp, "The effect of vertex reordering on 2D local mesh optimization efficiency," in Proc. of the 17th International Meshing Roundtable, Sandia National Laboratories, pp. 107-124, 2008.

11.
M.T. Jones and P.E. Plassmann, "A parallel graph coloring herustic," SIAM Journal of Scientific Computing, Vol. 14, no. 654, 1993.

12.
J. Kim, "The Effect of Mesh Reordering on Laplacian Smoothing for Nonuniform Memory Access Architecture-based High Performance Computing Systems", Journal of The Institute of Electronics and Information Engineers Vol. 51, NO. 3, March 2014.

13.
R.V. Garimella, "MSTK -A flexible infrastructure library for developing mesh based applications," in Proc. of the 13rd International Meshing Roundtable, Sandia National Laboratories, pp. 203-212. 2004.

14.
J. Kim, T. Panitanarak, S.M. Shontz, "A multiobjective mesh optimization framework for mesh quality improvement and mesh untangling," International Journal for Numerical Methods in Engineering, Vol. 94, pp. 20-42, 2013. crossref(new window)