Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Data Structures and Algorithms for the Finite Element Method on a Data Parallel Supercomputer
KTH, School of Computer Science and Communication (CSC), Centres, Centre for High Performance Computing, PDC. (Parallelldatorcentrum)
1990 (English)In: International Journal for Numerical Methods in Engineering, ISSN 0029-5981, E-ISSN 1097-0207, Vol. 29, no 4, p. 881-908Article in journal (Refereed) Published
Abstract [en]

This article describes a formulation of the finite element method and its implementation on a data parallel computing system. The Connection Machine® system, CM-2, has been used as the model architecture. Data structures, storage requirements, communication and parallel arithmetic complexity are analysed in detail for the cases when a processor represents an unassembled finite element and when a processor is assigned to an unassembled nodal point. Data parallel algorithms for the grid generation, the evaluation of the elemental stiffness matrices and for the iterative solution of the linear system are presented. The algorithm for evaluating the elemental stiffness matrices computes the matrix elements concurrently without communication. This concurrency is in addition to the inherent parallelism present among different finite elements. A conjugate gradient solver with diagonal pre-conditioner is used for the solution of the resulting linear system. Results from an implementation of the three-dimensional finite element method based on Lagrange elements are reported. For single-precision floating-point operations, the measured peak performance is approximately 2·4 G flops s−1 for evaluating the elemental stiffness matrices and approximately 850 M flops s−1 for the conjugate gradient solver. On a Connection Machine system with 16K physical processors, the time per conjugate gradient iteration for an application with 400 000 degrees of freedom is approximately 0·13 s for double-precision floating-point operations.

Place, publisher, year, edition, pages
1990. Vol. 29, no 4, p. 881-908
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:kth:diva-91062DOI: 10.1002/nme.1620290414OAI: oai:DiVA.org:kth-91062DiVA, id: diva2:507914
Note
NR 20140805Available from: 2012-03-06 Created: 2012-03-06 Last updated: 2018-01-12Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Search in DiVA

By author/editor
Johnsson, Lennart
By organisation
Centre for High Performance Computing, PDC
In the same journal
International Journal for Numerical Methods in Engineering
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 20 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf