✦ LIBER ✦

A parallel algorithm for stiffness matrix assembling in a shared memory environment

✍ Scribed by Marcelo Novaes De Rezende; Joao Batista de Paiva

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 285 KB
Volume: 76
Category: Article
ISSN: 0045-7949
DOI: 10.1016/s0045-7949(99)00181-9

No coin nor oath required. For personal study only.

✦ Synopsis

This paper describes an algorithm for parallel assembling of the stiness matrix in structural analysis in shared memory environments. In this algorithm the stiness matrix is assembled by groups of lines related to each node of the ®nite element mesh. Therefore as each processor will only assemble the lines related to a speci®c group of nodes, no synchronization is required to avoid that two or more processor try to update the same part of the memory concurrently and the task can be equally distributed among processors. Some examples are presented and they show that the proposed algorithm has a very good speed up rate and eciency.

📜 SIMILAR VOLUMES

Modelling a fast parallel thinning algor

Modelling a fast parallel thinning algorithm for shared memory SIMD computers

✍ Rabi N. Mahapatra; Harish Pareek 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 475 KB

Parallel algorithms for QR decomposition

Parallel algorithms for QR decomposition on a shared memory multiprocessor

✍ K. Wright 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 733 KB

Wright K., Parallel algorithms for QR decomposition on a shared memory multiprocessor, Parallel Computing 17 (1991) 779-790. Various parallel implementations of algorithms for the QR decomposition of a matrix are compared using shared memory multiprocessors. Algorithms based on both Givens and Hous

A novel parallel algorithm for large-sca

A novel parallel algorithm for large-scale Fock matrix construction with small locally distributed memory architectures: RT parallel algorithm

✍ Hajime Takashima; So Yamada; Shigeru Obara; Kunihiro Kitamura; Shinjiro Inabata; 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB 👁 1 views

## Abstract We developed a novel parallel algorithm for large‐scale Fock matrix calculation with small locally distributed memory architectures, and named it the “__RT__ parallel algorithm.” The __RT__ parallel algorithm actively involves the concept of integral screening, which is indispensable fo

Parallel algorithms for the quasi-triang

Parallel algorithms for the quasi-triangular generalized sylvester matrix equation on a shared memory multiprocessor : M. Marqués, V. Hernández, pp 23–28

📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 130 KB

A Parallel Recursive Shortest Spanning T

A Parallel Recursive Shortest Spanning Tree Algorithm for Image Segmentation in Distributed Computing Environment

✍ S.H Kwok; A.G Constantinides 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 667 KB

A parallel algorithm, architecture and F

A parallel algorithm, architecture and FPGA realization for landmark determination and map construction in a planar unknown environment

✍ P. Rajesh Kumar; K. Sridharan; S. Srinivasan 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 384 KB

Good representations of the environment are crucial for navigation of autonomous systems. This paper presents a time and space-efficient hardware-based solution for construction of an environment map based on range sensor data gathered by a robot at P locations in an unknown 2D environment. In parti