Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013 (2013), Article ID 751030, 6 pages
http://dx.doi.org/10.1155/2013/751030
Research Article

Mesh Partitioning Algorithm Based on Parallel Finite Element Analysis and Its Actualization

1State Key Laboratory of Simulation and Regulation of Water Cycle in River Basin, China Institute of Water Resources and Hydropower Research, Beijing 100038, China
2Beijing Institute of Water, Beijing 100044, China

Received 18 July 2013; Accepted 4 September 2013

Academic Editor: Zhiqiang Hu

Copyright © 2013 Lei Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. Z. Lei, High Performance Computing Method and Its Application in Hydraulic Structure Analysis, Hohai University, Nanjing, China, 2008.
  2. M. J. Berger and S. H. Bokhari, “A partitioning strategy for nonuniform problems on multiprocessors,” IEEE Transactions on Computers, vol. C-36, no. 5, pp. 570–580, 1987. View at Google Scholar · View at Scopus
  3. M. T. Heath and P. Raghavan, “A Cartesian parallel nested dissection algorithm,” SIAM Journal on Matrix Analysis and Applications, vol. 16, no. 1, pp. 235–253, 1995. View at Google Scholar
  4. B. W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” The Bell System Technical Journal, vol. 49, no. 2, pp. 291–307, 1970. View at Google Scholar
  5. C. Walshaw and M. Cross, “Mesh partitioning: a multilevel balancing and refinement algorithm,” SIAM Journal on Scientific Computing, vol. 22, no. 1, pp. 63–80, 2000. View at Publisher · View at Google Scholar · View at Scopus
  6. G. Karypis and V. Kumar, “A fast and high quality multilevel scheme for partitioning irregular graphs,” SIAM Journal on Scientific Computing, vol. 20, no. 1, pp. 359–392, 1998. View at Google Scholar · View at Scopus
  7. G. Karypis and V. Kumar, “Multilevelk-way partitioning scheme for irregular graphs,” Journal of Parallel and Distributed Computing, vol. 48, no. 1, pp. 96–129, 1998. View at Publisher · View at Google Scholar · View at Scopus
  8. G. Karypis and K. Schloegel, PARMETIS: Parallel Graph Partitioning and Sparse Matrix Ordering Library, Version 4.0, University of Minnesota, Minneapolis, Minn, USA, 2013.
  9. G. Karypis and V. Kumar, “A parallel algorithm for multilevel graph partitioning and sparse matrix ordering,” Journal of Parallel and Distributed Computing, vol. 48, no. 1, pp. 71–95, 1998. View at Publisher · View at Google Scholar · View at Scopus
  10. C. Walshaw and M. Cross, “JOSTLE: parallel multilevel graph-partitioning software—an overview,” in Mesh Partitioning Techniques and Domain Decomposition Techniques, pp. 27–58, Civil-Comp Press, 2007. View at Google Scholar
  11. T. F. Kong, Multilevel Spectral Clustering: Graph Partitions and Image Segmentation, Massachusetts Institute of Technology, 2008.
  12. L. Grady and E. L. Schwartz, “Isoperimetric partitioning: a new algorithm for graph partitioning,” SIAM Journal on Scientific Computing, vol. 27, no. 6, pp. 1844–1866, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. D. A. Tolliver and G. L. Miller, “Graph partitioning by spectral rounding: applications in image segmentation and clustering,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '06), pp. 1053–1060, June 2006. View at Publisher · View at Google Scholar · View at Scopus
  14. J. J. Dongarra, I. Foster, G. Fox, K. Kennedy, and L. Torczon, Sourcebook of Parallel Computing, Morgan Kaufmann Publishers, 2003.
  15. D. LaSalle and G. Karypis, “Multi-threaded graph partitioning,” in Proceedings of the 27th IEEE International Parallel & Distributed Processing Symposium, 2013.