Computational results for parallel unstructured mesh computations
- Univ. of Tennessee, Knoxville, TN (United States). Computer Science Dept.
- Argonne National Lab., IL (United States). Mathematics and Computer Science Div.
The majority of finite element models in structural engineering are composed of unstructured meshes. These unstructured meshes are often very large and require significant computational resources; hence they are excellent candidates for massively parallel computation. Parallel solution of the sparse matrices that arise from such meshes has been studied heavily, and many good algorithms have been developed. Unfortunately, many of the other aspects of parallel unstructured mesh computation have gone largely ignored. The authors present a set of algorithms that allow the entire unstructured mesh computation process to execute in parallel -- including adaptive mesh refinement, equation reordering, mesh partitioning, and sparse linear system solution. They briefly describe these algorithms and state results regarding their running-time and performance. They then give results from the 512-processor Intel DELTA for a large-scale structural analysis problem. These results demonstrate that the new algorithms are scalable and efficient. The algorithms are able to achieve up to 2.2 gigaflops for this unstructured mesh problem.
- Research Organization:
- Argonne National Lab., IL (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 34394
- Report Number(s):
- ANL/MCS/CP--84514; CONF-9411205--1; ON: DE95005856
- Country of Publication:
- United States
- Language:
- English
Similar Records
Mapping unstructured grid computations to massively parallel computers. Ph. D. Thesis - Rensselaer Polytechnic Inst. , Feb. 1992
Parallel algorithms for the adaptive refinement and partitioning of unstructured meshes