Parallel algorithms for the adaptive refinement and partitioning of unstructured meshes
Conference
·
OSTI ID:10161928
- Tennessee Univ., Knoxville, TN (United States). Dept. of Computer Science
- Argonne National Lab., IL (United States)
The efficient solution of many large-scale scientific calculations depends on adaptive mesh strategies. In this paper we present new parallel algorithms to solve two significant problems that arise in this context: the generation of the adaptive mesh and the mesh partitioning. The crux of our refinement algorithm is the identification of independent sets of elements that can be refined in parallel. The objective of our partitioning heuristic is to construct partitions with good aspect rations. We present run-time bounds and computational results obtained on the Intel DELTA for these algorithms. These results demonstrate that the algorithms exhibit scalable performance and have run-times small in comparison with other aspects of the computation.
- Research Organization:
- Argonne National Lab., IL (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 10161928
- Report Number(s):
- ANL/MCS/CP--83250; CONF-9405100--11; ON: DE94013966
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel algorithms for adaptive mesh refinement
Parallel algorithms for adaptive mesh refinement
Computational results for parallel unstructured mesh computations
Technical Report
·
Fri Aug 01 00:00:00 EDT 1997
·
OSTI ID:515612
Parallel algorithms for adaptive mesh refinement
Journal Article
·
Thu May 01 00:00:00 EDT 1997
· SIAM Journal on Scientific Computing
·
OSTI ID:509276
Computational results for parallel unstructured mesh computations
Technical Report
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:34394