A Novel FDTD Approach Featuring Two-Level Parallelization on PC Cluster
A Novel FDTD Approach Featuring Two-Level Parallelization on PC Cluster
复制标题
DOI：
10.2528/pier07120703
复制
发表时间：
2008
影响因子：
6.7
通讯作者：
Yu Liu;Z. Liang;Ziqiang Yang
中科院分区：
文献类型：
--
作者：
Yu Liu;Z. Liang;Ziqiang Yang
为了提高细粒度FDTD计算在PC机群上的并行效率，提出了“两级并行化”的概念，并开发了一种高性能的MPI-OpenMP混合FDTD算法。混合算法在区域分解FDTD方法的基础上，采用MPI和OpenMP多线程技术实现数据和任务的两级并行。此外，为了提高并行FDTD的灵活性，文中还讨论了子空间间的插值问题。最后给出了一个汽车用印刷天线的仿真实例。在不同的PC机数目下进行了计算，并与两种传统的并行FDTD算法在PC机群上进行了对比。结果表明，随着计算粒度的减小，新算法的计算效率提高，同时减小了子域虚拟拓扑对并行FDTD性能的影响。
To improve the parallel efficiency in the case of the fine- grained FDTD computing on PC cluster, the concept of "two level parallelization on PC cluster" is presented, and a high performance MPI-OpenMP hybrid FDTD algorithmis developed. In the hybrid algorithm, MPI is used in conjunction with OpenMP multithreading to achieve two level parallelismof the data and tasks at the basis of the domain decomposition FDTD method. Besides, to enhance the flexibility of the parallel FDTD, the interpolation between subspaces is also discussed. The simulation example of a printed antenna for automobile is given. Computations are performed for different numbers of PCs and contrasted with two conventional parallel FDTD algorithms on PC cluster. The results show that with the decrease of the computational granularity on each computer, the novel algorithm is more efficient, and moreover, it can also lessen the influence of the sub-domains virtual topology on the parallel FDTD performance.