Article

A scalable parallel fast multipole method for analysis of scattering from perfect electrically conducting surfaces

Authors:

Bhanu Hariharan,

Srinivas Aluru,

Balasubramaniam ShankerAuthors Info & Claims

SC '02: Proceedings of the 2002 ACM/IEEE conference on Supercomputing

Pages 1 - 17

Published: 16 November 2002 Publication History

Abstract

In this paper, we develop a parallel Fast Multipole Method (FMM) based solution for computing the scattered electromagnetic fields from a Perfect Electrically Conducting (PEC) surface. The main contributions of this work are the development of parallel algorithms with the following characteristics: 1) provably efficient worst-case run-time irrespective of the shape of the scatterer, 2) communication-efficiency, and 3) guaranteed load balancing within a small constant factor. We have developed a scalable, parallel code and validated it against surfaces for which solution can be computed analytically, and against serial software. The efficiency and scalability of the code is demonstrated with experimental results on an IBM xSeries cluster. Though developed in the context of this particular application, our algorithms can be used in other applications involving parallel FMM.

References

[1]

R. Coifman, V. Rokhlin, and S. Wandzura, "The fast multipole method for the wave equation: a pedestrian prescription," IEEE Antennas and Propagation Magazine, vol. 35, pp. 7--12, 1993.]]

[2]

C. C. Lu and W. C. Chew, "Fast algorithm for solving hybrid integral equations," IEE Proceedings. H, Microwaves, Antennas and Propagation, vol. 140, pp. 455--460, 1992.]]

[3]

C. C. Lu and W. C. Chew, "A multilevel algorithm for solving boundary integral wave scattering," Microwave and Optical Technology Letters, vol. 7, pp. 466--470, 1994.]]

[4]

C. C. Lu and W. C. Chew, "Fast far-field approximation for calculating the RCS of large objects," Microwave and Optical Technology Letters, vol. 8, pp. 238--241, 1995.]]

[5]

B. Dembart and E. Yip, "The accuracy of fast multipole methods for maxwell's equations," IEEE Computational Science and Engineering, vol. 5, pp. 48--56, 1998.]]

Digital Library

[6]

V. Jandhyala, B. Shanker, E. Michielssen, and W. Chew, "Fast algorithm for the analysis of scattering by dielectric rough surfaces," Journal of Optical Society of America, vol. 15, pp. 1877--1885, 1998.]]

[7]

V. Jandhyala, E. Michielssen, B. Shanker, and W. Chew, "A combined steepest descent fast multipole algorithm for the fast analysis of three-dimensional scattering by rough surfaces," IEEE Transactions on Geoscience and Remote Sensing, vol. 36, pp. 738--748, 1998.]]

[8]

V. Jandhyala, D. Sengupta, E. M. E, B. Shanker, and G. Stillman, "Two-dimensional rough surface couplers for broadband quantum-well infrared photodetectors," Applied Physics Letters, vol. 73, pp. 3495--3497, 1998.]]

[9]

K. Aygün, B. Shanker, A. A. Ergin, and E. Michielssen, "A two-level plane wave time domain algorithm for fast analysis of EMC/EMI problems," IEEE Transactions on EMC, vol. 44, pp. 152--164, 2002.]]

[10]

W. C. Chew, J. M. Jin, E. Michielssen, and J. Song, eds., Fast and Efficeint Algorithms for Computational Electromagnetics. New York, NY: Artech House, 2001.]]

Digital Library

[11]

N. Geng, A. Sullivan, and L. Carin, "Multilevel fast-multipole algorithm for scattering from conducting targets above or embedded in a lossy half space," IEEE Transactions on Geoscience and Remote Sensing, vol. 38, pp. 1561--1573, 2000.]]

[12]

N. Geng, A. Sullivan, and L. Carin, "Fast multipole method for scattering from an arbitrary PEC target above or buried in a lossy half space," IEEE Transactions on Antennas and Propagation, vol. 49, pp. 740--748, 2001.]]

[13]

V. Rokhlin, "Rapid solution of integral equations of classical potential theory," Journal of Computational Physics, vol. 60, pp. 187--207, 1985.]]

[14]

L. Greengard, The rapid evaluation of potential fields in particle systems. Cambridge, MA: MIT Press, 1988.]]

[15]

M. S. Warren and J. K. Salmon, "Astrophysical N-body simulations using hierarchical tree data structures," in Proceedings of Supercomputing, pp. 570--576, 1992.]]

Digital Library

[16]

M. Warren and J. Salmon, "A parallel hashed oct-tree N-body algorithm," in Proceedings of Supercomputing, pp. 1--12, 1993.]]

Digital Library

[17]

J. Singh, C. Holt, T. Tosuka, A. Gupta, and J. Hennessy, "Load balancing and data locality in adaptive hierarchical N-body methods: Barnes-hut, fast multipole and radiosity," Journal of Parallel and Distributed Computing, vol. 27, pp. 118--141, 1995.]]

Digital Library

[18]

A. Grama, V. Kumar, and A. Sameh, "Parallel hierarchical solvers and preconditioners for boundary element method," SIAM Journal on Scientific Computing, vol. 20, pp. 337--358, 1998.]]

Digital Library

[19]

P. Liu and S. Bhatt, "Experiences with parallel N-body simulation," IEEE Transactions on Parallel and Distributed Systems, vol. 11, pp. 1306--1323, 2000.]]

Digital Library

[20]

S. H. Teng, "Provably good partitioning and load balancing algorithms for parallel adaptive N-body simulation," SIAM Journal on Scientific Computing, vol. 19, pp. 635--656, 1998.]]

Digital Library

[21]

H. Schwichtenberg, G. Winter, and H. Wallmeier, "Acceleration of molecular mechanic simulation by parallelization and fast multipole techniques," Parallel Computing, vol. 25, pp. 535--546, 1999.]]

[22]

Y. Yuan and P. Banerjee, "A parallel implementation of a fast multipole based 3-D capacitance extraction program on distributed memory multicomputers," Journal of Parallel and Distributed Computing, vol. 61, pp. 1751--1774, 2001.]]

Digital Library

[23]

K. Donepudi, J. Jin, S. Velamparambil, J. Song, and W. Chew, "A higher-order parallelized multilevel fast multipole algorithm for 3-d scattering," IEEE Transactions on Antennas and Propagation, vol. 49, pp. 1069--1078, 2001.]]

[24]

F. Sevilgen, S. Aluru, and N. Futamura, "A provably optimal, distribution-independent parallel fast multipole method," in Proceedings of International Parallel and Distributed Processing Symposium, pp. 77--84, IEEE Computer Society Press, 2000.]]

Digital Library

[25]

P. B. Callahan and S. R. Kosaraju, "A decomposition of multidimensional point sets with applications to k-nearest neighbors and n-body potential fields," Journal of the ACM, vol. 42, pp. 67--90, 1995.]]

Digital Library

[26]

S. M. Rao and D. R. Wilton, "Transient scattering by conducting surfaces of arbitrary shape," IEEE Transactions on Antennas and Propagation, vol. 39, pp. 56--61, 1991.]]

[27]

B. Shanker, K. Aygün, N. Gres, and E. Michielssen, "Fast integral equation based analysis of transient electromagnetic scattering from three-dimensional inhomogeneous lossy dielectric objects," in Proceedings of the IEEE Antennas and Propagation Society, vol. 2, pp. 532--535, 2001.]]

[28]

S. Aluru and F. Sevilgen, "Dynamic compressed hyperoctrees with application to the N-body problem," in Proceedings of the Foundations of Software Technology and Theoretical Computer Science, vol. 1738, pp. 21--33, Springer-Verlag Lecture Notes in Computer Science, 1999.]]

Digital Library

[29]

R. Jakob-Chien and B. K. Alpert, "A fast spherical filter with uniform resolution," Journal of Computational Physics, vol. 136, pp. 580--584, 1997.]]

Digital Library

[30]

B. Shanker, A. A. Ergin, M. Lu, and E. Michielssen, "Multilevel plane wave time domain algorithm for the analysis of transient electromagnetic scattering," tech. rep., University of Illinois at Urbana, 2001. To appear in IEEE Transactions on Antennas and Propagation.]]

[31]

G. M. Morton, "A computer oriented geodetic data base and a new technique in file sequencing," tech. rep., IBM.]]

Cited By

Coulaud OFortin PRoman J(2010)High performance BLAS formulation of the adaptive Fast Multipole MethodMathematical and Computer Modelling: An International Journal10.1016/j.mcm.2009.08.03951:3-4(177-188)Online publication date: 1-Feb-2010
https://dl.acm.org/doi/10.1016/j.mcm.2009.08.039
Sundar HSampath RAdavani SDavatzikos CBiros GVerastegui B(2007)Low-constant parallel algorithms for finite element simulations using linear octreesProceedings of the 2007 ACM/IEEE conference on Supercomputing10.1145/1362622.1362656(1-12)Online publication date: 16-Nov-2007
https://dl.acm.org/doi/10.1145/1362622.1362656
Ying LBiros GZorin DLangston HMcGraw J(2003)A New Parallel Kernel-Independent Fast Multipole MethodProceedings of the 2003 ACM/IEEE conference on Supercomputing10.1145/1048935.1050165Online publication date: 15-Nov-2003
https://dl.acm.org/doi/10.1145/1048935.1050165

Index Terms

A scalable parallel fast multipole method for analysis of scattering from perfect electrically conducting surfaces

Recommendations

A New Parallel Kernel-Independent Fast Multipole Method
SC '03: Proceedings of the 2003 ACM/IEEE conference on Supercomputing

We present a new adaptive fast multipole algorithm and its parallel implementation. The algorithm is kernel-independent in the sense that the evaluation of pairwise interactions does not rely on any analytic expansions, but only utilizes kernel ...
Efficient fast multipole method for low-frequency scattering

The solution of the Helmholtz and Maxwell equations using integral formulations requires to solve large complex linear systems. A direct solution of those problems using a Gauss elimination is practical only for very small systems with few unknowns. The ...
Scalable fast multipole methods on heterogeneous architecture

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SC '02: Proceedings of the 2002 ACM/IEEE conference on Supercomputing

November 2002

952 pages

ISBN:076951524X

Conference Chair:
Roscoe Giles
Boston University
,
Program Chair:
Daniel Reed
NCSA
,
Publications Chair:
Kathryn Kelley
Ohio Supercomputer Center

Sponsors

SIGARCH: ACM Special Interest Group on Computer Architecture
IEEE-CS: Computer Society

Publisher

IEEE Computer Society Press

Washington, DC, United States

Publication History

Published: 16 November 2002

Check for updates

Qualifiers

Article

Conference

SC '02

Sponsor:

SIGARCH
IEEE-CS

SC '02: International Conference for High Performance Computing, Networking, Storage and Analysis

16 11 2002

Maryland, Baltimore

Acceptance Rates

SC '02 Paper Acceptance Rate 67 of 230 submissions, 29%;

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
528
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

Coulaud OFortin PRoman J(2010)High performance BLAS formulation of the adaptive Fast Multipole MethodMathematical and Computer Modelling: An International Journal10.1016/j.mcm.2009.08.03951:3-4(177-188)Online publication date: 1-Feb-2010
https://dl.acm.org/doi/10.1016/j.mcm.2009.08.039
Sundar HSampath RAdavani SDavatzikos CBiros GVerastegui B(2007)Low-constant parallel algorithms for finite element simulations using linear octreesProceedings of the 2007 ACM/IEEE conference on Supercomputing10.1145/1362622.1362656(1-12)Online publication date: 16-Nov-2007
https://dl.acm.org/doi/10.1145/1362622.1362656
Ying LBiros GZorin DLangston HMcGraw J(2003)A New Parallel Kernel-Independent Fast Multipole MethodProceedings of the 2003 ACM/IEEE conference on Supercomputing10.1145/1048935.1050165Online publication date: 15-Nov-2003
https://dl.acm.org/doi/10.1145/1048935.1050165

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents