To read this content please select one of the options below:

Investigation of parallel computation in 3D magnetic field analysis on distributed memory type of multiprocessors containing 296 PUs

N. Takahashi (Department of Electrical and Electronic Engineering, Okayama University, Tsushima, Okayama, Japan)
T. Nakano (Department of Electrical and Electronic Engineering, Okayama University, Tsushima, Okayama, Japan)
K. Fujiwara (Department of Electrical and Electronic Engineering, Okayama University, Tsushima, Okayama, Japan)
K. Muramatsu (Department of Electrical and Electronic Engineering, Okayama University, Tsushima, Okayama, Japan)
142

Abstract

The algorithm of parallelized conjugate gradient method for solving large‐scale linear equations is investigated. The performance of the algorithm is evaluated by solving sparse and full matrices on distributed memory type of parallel computer containing 296PUs. It is shown that the speed‐up ratio of the parallel computation of sparse matrix is saturated at several ten PUs due to large broadcasting time of data among PUs.

Keywords

Citation

Takahashi, N., Nakano, T., Fujiwara, K. and Muramatsu, K. (1998), "Investigation of parallel computation in 3D magnetic field analysis on distributed memory type of multiprocessors containing 296 PUs", COMPEL - The international journal for computation and mathematics in electrical and electronic engineering, Vol. 17 No. 6, pp. 726-731. https://doi.org/10.1108/03321649810221288

Publisher

:

MCB UP Ltd

Copyright © 1998, MCB UP Limited

Related articles