High performance computing for the level-set reconstruction algorithm

Authors:
Mohammad R. Hajihashemi;Magda El-Shenawee
Affiliations:
University of Arkansas, Fayetteville, AR 72701, USA;University of Arkansas, Fayetteville, AR 72701, USA
Venue:
Journal of Parallel and Distributed Computing
Year:
2010

Citing 7
Cited 1

Using MPI (2nd ed.): portable parallel programming with the message-passing interface

Using MPI (2nd ed.): portable parallel programming with the message-passing interface
Sourcebook of parallel computing

Sourcebook of parallel computing
Level set and total variation regularization for elliptic inverse problems with discontinuous coefficients

Journal of Computational Physics
Parallelization of a level set method for simulating dendritic growth

Journal of Parallel and Distributed Computing
Design of piezoelectric actuators using a multiphase level set method of piecewise constants

Journal of Computational Physics
A parallelized, adaptive algorithm for multiphase flows in general geometries

Computers and Structures
Electrical impedance tomography using level set representation and total variational regularization

Journal of Computational Physics

Parallel implementation of the diffusion-drift algorithm for modeling the electrophysiological activity of breast tumors

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A parallelized version of the level-set algorithm based on the MPI technique is presented. TM-polarized plane waves are used to illuminate two-dimensional perfect electric conducting targets. A variety of performance measures such as the efficiency, the load balance, the weak scaling, and the communication/computation times are discussed. For electromagnetic inverse scattering problems, retrieving the target's arbitrary shape and location in real time is considered as a main goal, even as a trade-off with algorithm efficiency. For the three cases considered here, a maximum speedup of 53X-84X is achieved when using 256 processors. However, the overall efficiency of the parallelized level-set algorithm is 21%-33% when using 256 processors and 26%-52% when using 128 processors. The effects of the bottlenecks of the level-set algorithm on the algorithm efficiency are discussed.