Parallel adaptive mesh generation and decomposition

Engineering with Computers

Volumn 12, Issue 3-4, 1996, Pages 155-167

  Wu, P ^a,b   Houstis, E N ^a  

^a PURDUE UNIVERSITY   (United States)

^b Purdue University   (United States)

Author keywords

Mesh decomposition; Mesh generation; Parallel computation

Indexed keywords

CALCULATIONS; COMPUTER HARDWARE; GEOMETRY; MATHEMATICAL MODELS; NUMERICAL METHODS;

MESH DECOMPOSITION; MESH GENERATION;

PARALLEL PROCESSING SYSTEMS;

EID: 0030381213     PISSN: 01770667     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01198731     Document Type: Article

References (50)

1. Chrisochoides, N.P.; Houstis, E.N.; Rice, J.R. (1994) Mapping algorithms and software environments for data parallel PDE iterative solvers. Journal of Distributed and Parallel Computing, 21, 75-95
2. Chrisochoides, N.P.; Houstis, E.N.; Houstis, C.E. (1991) Geometry based mapping strategies for PDE computations. Proceedings of the International Conference on Supercomputing. Cologne-Germany, 128-135
3. Houstis, E.N.; Houstis, C.E.; Rice, J.R.; Weerawarana, S. (1994) PYTHIA: A computationally intelligent paradigm to support smart problem solving environments for PDE based applications, ACM Transactions on Mathematical Software, 1996 (to appear)
4. Houstis, E.N.; Rice, J.R. (1992) Parallel ELLPACK: A development and problem solving environment for high performance computing machines. Programming Environments for High-level Scientific Problem Solving (Gaffney, P.W.; Houstis, E.N., Editors). North-Holland, Amsterdam, 229-241
5. Kim, S.; Houstis, E.N.; Rice, J.R. (1994) Parallel stationary iterative methods and their performance. To appear in Proceedings of the INTEL supercomputer users group conference (Marinescu, D., Frost, R., Editors). San Diego
6. Farhat, C.; Simon, H.D. (1993) TOP/DOMDEC - a software tool for mesh partitioning and parallel processing. Technical Report NASA Ames Research Center. RNR-93-011, 1-28
7. Tragoodas, S. (1994) Min-cut partitioning on underlying tree and graph structures, to appear in IEEE Transactions on Computers
8. Wu, P.; Houstis, E.N. (1993) Parallel dynamic mesh generation and domain decomposition. Technical Report, Purdue University. Department of Computer Sciences, CSD-TR-93-075, 1-49
9. Wu, P., Houstis, E.N. (1993) Parallel electronic prototyping of physical objects. Technical Report Purdue University, Department of Computer Sciences, CSD-TR-93-026, 1-48
10. Bykat, A. (1976) Automatic generation of triangular grid: I - Subdivision of a general polygon into convex subregions. II - Triangulation of convex polygons. International Journal for Numerical Methods in Engineering. 10, 1329-1342
11. Khan, A.I.; Topping, B.H.V. (1991) Parallel adaptive mesh generation. Computing Systems in Engineering. 2(1), 75-101
12. Lo, S.H. (1991) Automatic mesh generation and adaptation by using contours, International Journal for Numerical Methods in Engineering. 31, 689-707
13. Sadek, E.A. (1980) A scheme for the automatic generation of triangular finite elements. International Journal for Numerical Methods in Engineering. 15, 1815-1822
14. Cheng, F.; Jaromczyk, J.W.; Lin, J.; Chang. S.; Lu, J. (1989) A parallel mesh generation algorithm based on the vertex label alignment scheme, International Journal for Numerical Methods in Engineering, 28, 1429-1448
15. Samet, H. (1984) The quadtree and related hierarchical data structures. Computing Surveys. 16(2), 187-260
16. Mitchell, W.F. (1987) A comparison of adaptive refinement techniques for elliptic problems. Technical Report, University of Illinois at Urbana-Champaign, Department of Computer Science UIUCDCS-R-87-1375, 1-14
17. PATRAN (1992) A Division of PDA Engineering - PATRAN Plus User Manual Vols 1 and 2, PDA Engineering, PATRAN Division
18. Deloujie-Rakhshandeh, K. (1990) An approach to the generation of triangular grids possessing few obtuse triangles. International Journal for Numerical Methods in Engineering, 29, 1299-1321
19. Baase, S. (1988) Graphs and Digraphs, Computer Algorithms: Introduction to Design and Analysis, Addison-Wesley, Reading, MA, Ch. 4, 145-207
20. Farhat, C. (1988) A simple and efficient automatic FEM domain decomposer. Computers & Structures, 28(5), 579-602
21. Farhat, C.; Lesoinne, M. (1993) Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanics, International Journal for Numerical Methods in Engineering, 36, 745-764
22. George, A; Liu, J.W.H. (1979) An implementation of a pseudoperipheral node finder, ACM Transactions on Mathematical Software, 5(3), 284-295
23. Gibbs, N.E., Poole, J.W.G., Stockmeyer, P.K. (1976) An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM Journal of Numerical Analysis, 13(2), 236-250
24. Malone, J.G. (1988) Automatic mesh decomposition and concurrent finite element analysis for hypercube multiprocessor computers, Computer Methods in Applied Mechanics and Engineering, 70, 27-58
25. Pissanetsky, S. (1984) Ordering for Gauss elimination: symmetry matrices, Sparse Matrix Technology, Academic Press, Orlando, Ch. 4, 94-158
26. Chan, W.M.; George, A. (1900) A linear time implementation of the reverse Cuthill-McKee algorithm, BIT, 20, 8-14
27. George, A.; Liu, J.W.H. (1978) Algorithms for matrix partitioning and the numerical solution of finite element systems, SIAM Journal of Numerical Analysis, 15(2), 297-327
28. Barnard, S.T.; Simon, H.D. (1993) A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing. 711-718
29. Fiedler, M. (1975) A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Mathematical Journal, 25(100), 619-633
30. Fiedler, M. (1975) Eigenvectors of acyclic matrices, Czechoslovak Mathematical Journal 25(100), 607-618
31. Fiedler, M. (1973) Algebraic connectivity of graphs. Czechoslovak Mathematical Journal 23(98), 298-305
32. Hendrickson, B.; Lei and, R. (1993) An improved spectral load balancing method, Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, 953-961
33. Simon, H.D. (1991) Partitioning of unstructured problems for parallel processing. Computing Systems in Engineering, 2(2/3), 135-148.
34. Venkatakrishnan, V.; Simon, H.D. (1992) A MIMD implementation of a parallel Euler solver for unstructured grids. The Journal of Supercomputing, 6, 117-137
35. Loriot, M.; Fezoui, L. (1988) Mesh-splitting preprocessor. Unpublished manuscripts
36. Williams, R. (1992) Parallel meshes for complex geometry, PML, 302-312
37. Lohner, R.; Camberos, J.; Merriam, M. (1992) Parallel unstructured grid generation, Computer Methods in Applied Mechanics and Engineering, 95, 343-357
38. Kernighan, B.W.; Lin, S. (1970) An efficient heuristic procedure for partitioning graphs, The Bell System Technical Journal, 49, 291-307
39. Kirkpatrick, S.; Gelatt, J.C.D.; Vecchi, M.P. (1983) Optimization by simulated annealing. Science. 220(4598), 671-680
40. Johnson, D.S.; Aragon, C.R.; McGeoch, L.A.; Schevon, C. (1989) Optimization by simulated annealing: An experimental evaluation; Part I, Graph partitioning Operations Research, 37(6), 865-892
41. Saab, Y.G.; Rao, V.B. (1991) Combinatorial optimization by stochastic evolution. IEEE Transactions on Computer-Aided Design, 10(4), 525-535
42. Hertz, A.; Werra, D. (1997) Using Tabu search techniques for graph coloring. Computing, 39, 345-351
43. Glover, F.; McMillan, C. (1965/6) Interactive decision software and computer graphics for architectural and space planning. Annals of Operations Research, 5, 557-573
44. Savage, J.E.; Wloka, M.G. (1991) Parallelism in graph-partitioning. Journal of Parallel and Distributed Computing 13, 257-272
45. Geist, G.A.; Heath, M.T.; Peyton, B.W.; Worley, P.H. (1992) A users' guide to PICL a portable instrumented communication library. Technical Report Oak Ridge National Laboratory, Oak Ridge, TN, ORNL/TM-11616, 1-22
46. Geist, G.A.; Heath, M.T.; Peyton, B.W.; Worley, P.H. (1990) PICL; a portable instrumented communication library. C reference manual. Technical Report, Oak Ridge National Laboratory, Oak Ridge, TN, ORNL/TM-11130, 1-146
47. Heath, M.T.; Finger, J.E. (1993) ParaGraph: A tool for visualizing performance of parallel programs. Oak Ridge National Laboratory, Oak Ridge, RN, 1-50
48. Heath, M.T. (1993) Recent developments and case studies in performance visualization using ParaGraph. Performance Measurement and Visualization of Parallel Systems (Haring, G.; Kotsis, G., Editors). Elsevier Science Publishers, Amsterdam, 175-200
49. Heath, M.T.; Finger, J.E. (1991) Visualizing the performance of parallel programs, IEEE Software, 8(5), 29-39
50. Al-Nastra, M.; Nguyen, D.T. (1991) An algorithm for domain decomposition in finite element analysis. Computers & Structures, 39(3/4), 277-289