Affiliation:
1. IBM Research, Zurich
2. University of Paderborn, Germany
Abstract
Finite difference methods are widely used, highly parallel algorithms for solving differential equations. However, the algorithms are memory bound and thus difficult to implement efficiently on CPUs or GPUs. In this work we study the implementation of the finite difference time domain (FDTD) method for solving Maxwell's equations on an FPGA-based Maxeler dataflow computer. We evaluate our work with actual problems from the domain of computational nanophotonics. The use of realistic simulations requires us to pay special attention to boundary conditions (Dirichlet, periodic, absorbing), which are critical for the correctness of results but detrimental to the performance and thus frequently neglected. We discuss and evaluate the design of two different FDTD implementations, which outperform CPU and GPU implementations. To our knowledge, our implementation is the fastest FPGA-based FDTD solver.
Publisher
Association for Computing Machinery (ACM)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Hardware Acceleration of Microwave Imaging Algorithms;Lecture Notes in Bioengineering;2023
2. Accurate Sampling with Noisy Forces from Approximate Computing;Computation;2020-04-28
3. HLS-Based FPGA Acceleration of Building-Cube Stencil Computation;Advances in Intelligent Systems and Computing;2017-07-05
4. DTP;Proceedings of the 8th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies;2017-06-07
5. OpenCL-Based FPGA Accelerator for 3D FDTD with Periodic and Absorbing Boundary Conditions;International Journal of Reconfigurable Computing;2017