Concurrent multifrontal methods: Shared memory, cache, and frontwidth issues
- 1. Sandia National Labs., Albuquerque, NM 87185
Description
Frontal methods are an efficient and popular means of Gauss elimination of matrix equations that arise in finite element analysis. Nested dissection of a computational domain makes possible high-level parallelism in a widely used frontal algorithm for unsymmetric systems. A concurrent, highly vectorized, multifrontal, finite element analysis of axisymmetric liquid drop oscillations with 2,210 equations runs on the CRAY X-MP/48 with factors of 1.9 and 2.9 reduction in elapsed time on two and four processors, respectively. On an ELXSI 6400 (which has an additional memory level, local processor cache, ignored in the algorithm's design for the CRAY), implementation of the same problem initially achieved a speedup of only 1.4 on four processors. Modification of the concurrent algorithm, to take advantage of the cache and frontwidth reduction by element reordering, doubled the concurrent speedup on the ELXSI to 2.8 on four processors
Additional details
Publishing Information
- Journal Title
- Int. J. Supercomput. Appl.
- Journal Volume
- 1
- Journal Issue
- 3
- Series
- Int. J. Supercomput. Appl.
- Journal Page Range
- 26-44
- ISSN
- 0890-2720
- CODEN
- IJSAE
INIS
- Country of Publication
- United States
- Country of Input or Organization
- United States
- INIS RN
- 19028382
- Subject category
- S42: ENGINEERING; S99: GENERAL AND MISCELLANEOUS;
- Descriptors DEI
- ALGORITHMS; ARRAY PROCESSORS; AXIAL SYMMETRY; CRAY COMPUTERS; DROPLETS; EFFICIENCY; FINITE ELEMENT METHOD; GAUSSIAN PROCESSES; LIQUID FLOW; MATRICES; MEMORY DEVICES; PARALLEL PROCESSING; SUPERCOMPUTERS; TURBULENCE
- Descriptors DEC
- COMPUTERS; DIGITAL COMPUTERS; FLUID FLOW; NUMERICAL SOLUTION; PARTICLES; PROGRAMMING; SYMMETRY