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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE antennas and wireless propagation letters Ročník 17; číslo 7; s. 1209 - 1212
Hlavní autori: Tan, Jundong, Li, Zihao, Guo, Qi, Long, Yunliang
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.07.2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
ISSN:1536-1225, 1548-5757
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia: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