Performing of the FDTD method calculations on 'Sergey Korolev' GPUs via MATLAB language
| Autor: | Nikita Morunov, Dimitry Golovashkin |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Speedup
Discretization Computer science Finite-difference time-domain method 020206 networking & telecommunications 02 engineering and technology Domain (software engineering) Computational science Algorithmic efficiency 0202 electrical engineering electronic engineering information engineering Decomposition (computer science) 020201 artificial intelligence & image processing General-purpose computing on graphics processing units MATLAB computer Block (data storage) computer.programming_language |
| Zdroj: | 2020 International Conference on Information Technology and Nanotechnology (ITNT). |
| DOI: | 10.1109/itnt49337.2020.9253360 |
| Popis: | The paper deals with the FDTD-method block algorithm efficiency and with its implementation in MATLAB language on the high performance computer called Sergey Korolev. Block algorithms with one-dimensional and two-dimensional decomposition are considered. As a result of the study, it was found that the one-dimensional decomposition efficiency is 3 times higher than the two-dimensional decomposition efficiency. The average performance of the FDTD-method block algorithm implementation with one-dimensional decomposition is 190 million nodes per second, which corresponds to 15 times speedup on the considered system. The maximum possible domain discretization in GPU computing has been expanded from 50 million to 410 million nodes. Also, it exceeded the maximum discretization in CPU computing by 60 million nodes. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|