An efficient algorithm for parallel stiffness matrix assembling

Authors:
A. Unterkircher;J. Reissner
Affiliations:
Institute for Virtual Production, ETH Zürich, Switzerland;Institute for Virtual Production, ETH Zürich, Switzerland
Venue:
ICECT'03 Proceedings of the third international conference on Engineering computational technology
Year:
2002

Citing 2
Cited 0

A simple parallel algorithm for the maximal independent set problem

SIAM Journal on Computing
Algorithms in C

Algorithms in C

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm for stiffness matrix assembling on shared memory multiprocessor architectures. The method has been developed for our 3D bulk forming FE code. After generating the dual graph of the FE mesh a recursive maximal independent set algorithm delivers indices of elements which do not share any nodes. These elements are being assembled by different processors and the element matrices can be directly added to the global stiffness matrix. The method is independent of dimension, model shape and element type. Furthermore it can be easily incorporated into an existing FE code.