An Efficient Parallel Implicit Solver for LOD-FDTD Algorithm in Cloud Computing Environment
This letter presents an efficient parallel algorithm for solving locally one-dimensional (LOD) finite-difference time domain (FDTD) in cloud computing environment. As opposed to the existing LOD-FDTD algorithm parallelization scheme, the proposed method solves the implicit tridiagonal system in para...
Saved in:
| Published in: | IEEE antennas and wireless propagation letters Vol. 17; no. 7; pp. 1209 - 1212 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
IEEE
01.07.2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 1536-1225, 1548-5757 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This letter presents an efficient parallel algorithm for solving locally one-dimensional (LOD) finite-difference time domain (FDTD) in cloud computing environment. As opposed to the existing LOD-FDTD algorithm parallelization scheme, the proposed method solves the implicit tridiagonal system in parallel by using the Sherman-Morrison formula to decompose the tridiagonal matrix into smaller matrices. The parallel nodes in cloud computers solve the matrices simultaneously. Numerical results show that the proposed method is more efficient in cloud computing environment than the conventional parallelization scheme and shows better scalability. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1536-1225 1548-5757 |
| DOI: | 10.1109/LAWP.2018.2839084 |