Efficiency of group implicit concurrent algorithms for transient finite element analysis
- Creators
-
Ortiz, M.
- Sotelino, E. D.
- Nour-Omid, B.
Abstract
The performance of group implicit algorithms is assessed on actual concurrent computers. We show that, as the number of subdomains is increased, performance enhancements are derived from two sources: the increased parallelism in the computations; and a reduction in equation solving effort. Moreover, we show that these two performance enhancements are synergistic, in the sense that the corresponding speed-ups are multiplied, rather than merely added. Our numerical simulations demonstrate that, if n is the number of degrees of freedom of the structure, p the number of processors used in the computations, and s ⩾ p is the number of subdomains in the partition, the net speed-up is O(p√s) in 2D and O(ps) in 3D, asymptotically as n/s → ∞. In particular, speed-ups with respect to Newmark's method of O(p√s) in 2D and O(s) in 3D are obtained on a single-processor machine. Finally, simulations on a 32-node hypercube are presented for which the interprocessor communication efficiencies obtained are consistently in excess of 90 per cent.
Additional Information
© 1989 John Wiley & Sons. Received 10 November 1988. Revised 21 February 1989. M. O. and E. D. S. gratefully acknowledge support from the NASA Langley Research Center under grant NAG-1-634. The computations on the Alliant FXS computer were performed at the Computational Mechanics Facility of the Division of Engineering at Brown University. The acquisition of this computer has been made possible, in part, by grants from the U.S. National Science Foundation and the Office of Naval Research.Additional details
- Eprint ID
- 84090
- Resolver ID
- CaltechAUTHORS:20180104-144109186
- NAG–1–634
- NASA
- NSF
- Office of Naval Research (ONR)
- Created
-
2018-01-05Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field
- Caltech groups
- GALCIT