Data Parallel Algorithms for the Finite Element Method
1990 (English)Conference paper (Refereed)
A data paralell implementation of the finite element method is described. The focus of the presentation is on data mapping and data motion. The essential ideas of the dataparallel implementation are developed for discretizations of regular domains by Lagrange elements ofarbitrary order in two and three dimensions, A generalization to irregular domains is also presented.Implementations of the data mappings for both regular and irregular domains have been made onthe Connection Machine®system model CM-2. Peak performances Well in excess of 2 Gñops have bee measured for the evaluation of the elemental stiffness matrices. The performance of the iterative solver is in the range of 600 850 Mñops s'1.
Place, publisher, year, edition, pages
1990. 257-267 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-65546OAI: oai:DiVA.org:kth-65546DiVA: diva2:483455
Proceedings of the Fourth SIAM Conference on Parallel Processing for Scientific Computing
NR 201408052012-01-252012-01-25Bibliographically approved