Multilevel mesh partitioning for optimizing domain shape

International Journal of High Performance Computing Applications

Volumn 13, Issue 4, 1999, Pages 334-353

  Walshaw, C ^a   Cross, M ^a   Diekmann, R ^b   Schlimbach, F ^a  

^a UNIVERSITY OF GREENWICH   (United Kingdom)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FINITE ELEMENT METHOD; FINITE VOLUME METHOD; OPTIMIZATION;

MULTILEVEL ALGORITHMS; MULTILEVEL MESH PARTITIONING;

PARALLEL PROCESSING SYSTEMS;

EID: 0033334875     PISSN: 10943420     EISSN: None     Source Type: Journal    
DOI: 10.1177/109434209901300404     Document Type: Article

References (25)

1. Barnard, S. T., and H. D. Simon. 1994. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice & Experience 6 (2): 101-17.
2. Blazy, S., W. Borchers, and U. Dralle. 1995. Parallelization methods for a characteristic's pressure correction scheme. In Flow simulation with high performance computers II: Notes on numerical fluid mechanics, edited by E. H. Hirschel. Braunschweig: Vieweg.
3. Bouhmala, N. 1998. Partitioning of unstructured meshes for parallel processing. Ph.D. dissertation, Inst. d'Informatique, Univ. Neuchatel.
4. Bramble, J. H., J. E. Pasciae, and A. H. Schatz. 1986. The construction of preconditioners for elliptic problems by sub-structuring I+II. Math Comp 47:103-34; 49:1-16.
5. Bramble, J. H., J. E. Pasciae, and A. H. Schatz. 1986. The construction of preconditioners for elliptic problems by sub-structuring I+II. Math Comp 47:103-34; 49:1-16.
6. Diekmann, R., B. Meyer, and B. Monien. 1998. Parallel decomposition of unstructured FEM-meshes. Concurrency: Practice & Experience 10 (1): 53-72.
7. Diekmann, R., F. Schlimbach, and C. Walshaw. 1998. Quality balancing for parallel adaptive FEM. In Proceedings of Irregular '98: Solving irregularly structured problems in parallel, vol. 1457 of LNCS, edited A. Ferreira et al., 170-81. Berlin: Springer.
8. Farhat, C., N. Maman, and G. Brown. 1995. Mesh partitioning for implicit computations via domain decomposition. Int J Numer Methods Engng 38:989-1000.
9. Farhat, C., J. Mandel, and F. X. Roux. 1994. Optimal convergence properties of the FETI domain decomposition method. Comput Methods Appl Mech Engng 115:365-85.
10. Fiduccia, C. M., and R. M. Mattheyses. 1982. A linear time heuristic for improving network partitions. In Proceedings of the 19th IEEE Design Automation Conference, 175-81. Piscataway, NJ: IEEE.
11. Gupta, A. 1996. Fast and effective algorithms for graph partitioning and sparse matrix reordering. IBM Journal of Research and Development 41 (1/2): 171-83.
12. Hendrickson, B., and R. Leland. 1993. A multilevel algorithm for partitioning graphs. Technical Report SAND 93-1301, Sandia National Labs, Albuquerque, NM.
13. Hendrickson, B., and R. Leland. 1995. A multilevel algorithm for partitioning graphs. In Proceedings of Supercomputing '95, New York: ACM Press.
14. Hu, Y. F., R. J. Blake, and D. R. Emerson. 1998. An optimal migration algorithm for dynamic load balancing. Concurrency: Practice & Experience 10 (6): 467-83.
15. Karypis, G., and V. Kumar. 1995a. A fast and high quality multilevel scheme for partitioning irregular graphs. Report TR 95-035, Department of Computer Science, University of Minnesota, Minneapolis.
16. Karypis, G., and V. Kumar. 1995b. Multilevel k-way partitioning scheme for irregular graphs. Report TR 95-064, Department of Computer Science, University of Minnesota, Minneapolis.
17. Kernighan, B. W., and S. Lin. 1970. An efficient heuristic for partitioning graphs. Bell Systems Tech J 49:291-308.
18. Kirkpatrick, S., C. D. Gelatt, and M. P. Vecchi. 1983. Optimization by simulated annealing. Science 220 (4598): 671-80.
19. Mitchell, S. A., and S. A. Vasavis. 1992. Quality mesh generation in three dimensions. In Proceedings of ACM Conference on Computer Geometry, 212-21. New York: ACM Press.
20. Schlimbach, F. 1998. Load balancing heuristics optimising sub-domain aspect ratios for adaptive finite element simulations. Diploma thesis, Department of Mathematics and Computer Science, University of Paderborn.
21. Vanderstraeten, D., C. Farhat, P. S. Chen, R. Keunings, and O. Zone. 1996. A retrofit based methodology for the fast generation and optimization of large-scale mesh partitions: Beyond the minimum interface size criterion. Comput Methods Appl Mech Engng 133:25-45.
22. Vanderstraeten, D., R. Keunings, and C. Farhat. 1995. Beyond conventional mesh partitioning algorithms and the minimum edge cut criterion: Impact on realistic applications. In Parallel processing for scientific computing, edited by D. Bailey et al., 611-14. Philadelphia, PA: SIAM.
23. Walshaw, C., and M. Cross. 1998. Mesh partitioning: A multilevel balancing and refinement algorithm. Technical Report 98/IM/35, University of Greenwich, London.
24. Walshaw, C., M. Cross, R. Diekmann, and F. Schlimbach. 1998. Multilevel mesh partitioning for aspect ratio. In Proceedings of VecPar'98, Porto, Portugal, 381-94. Porto, Portugal: Universidade do Porto.
25. Walshaw, C., M. Cross, and M. Everett. 1997. Parallel dynamic graph partitioning for adaptive unstructured meshes. J Par Dist Comput 47 (2): 102-8.