Change search
ReferencesLink to record
Permanent link

Direct link
Data Parallel Algorithms for the Finite Element Method
KTH, School of Computer Science and Communication (CSC), Centres, Centre for High Performance Computing, PDC. (Parallelldatorcentrum)
1990 (English)Conference paper (Refereed)
Abstract [en]

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.
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-65546OAI: diva2:483455
Proceedings of the Fourth SIAM Conference on Parallel Processing for Scientific Computing
NR 20140805Available from: 2012-01-25 Created: 2012-01-25Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Johnsson, Lennart
By organisation
Centre for High Performance Computing, PDC
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 9 hits
ReferencesLink to record
Permanent link

Direct link