Name
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.jpdc.2009.10.001 | J. Parallel Distrib. Comput. |
Keywords | Field | DocType |
inverse problem,parallelized version,level-set,level-set reconstruction algorithm,message passing interface (mpi),parallel processing,algorithm efficiency,tm-polarized plane wave,level-set algorithm,arbitrary shape,parallelized level-set algorithm,high performance computing,electromagnetic inverse scattering problem,overall efficiency,computation time,mpi technique,load balance,message passing interface,real time,level set,electric conductivity,plane waves | Algorithmic efficiency,Supercomputer,Parallel algorithm,Load balancing (computing),Computer science,Parallel computing,Level set,Reconstruction algorithm,Distributed computing,Speedup,Computation | Journal |
Volume | Issue | ISSN |
70 | 6 | Journal of Parallel and Distributed Computing |
Citations | PageRank | References |
1 | 0.36 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohammad R. Hajihashemi | 1 | 3 | 0.94 |
| Magda El-Shenawee | 2 | 61 | 11.32 |