scholarly journals Computing of 3D Bifurcation Diagrams With Nvidia CUDA Technology

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 157773-157780
Author(s):  
Artur Pala ◽  
Marek Machaczek
Doklady BGUIR ◽  
2021 ◽  
Vol 19 (3) ◽  
pp. 14-21
Author(s):  
S. S. Sherbakov ◽  
M. M. Polestchuk

The evolution of computer technologies, as a hardware and a software parts, allows to attain fast and accurate  solutions  to  many  applied  problems  in  scientific  areas.  Acceleration  of  calculations  is  broadly  used technic that is basically implemented by multithreading and multicore processors. NVidia CUDA technology or simply CUDA opens a way to efficient acceleration of boundary elements method (BEM), that includes many independent stages. The main goal of the paper is implementation and acceleration of indirect boundary element method using three form functions. Calculation of the potentialdistribution inside a closed boundary under the action of the defined boundary condition is considered. In order to accelerate corresponding calculations, they were parallelized at the graphic accelerator using NVidia CUDA technology. The dependences of acceleration of parallel  computations  as  compared  with  sequential  ones  were explored  for  different  numbers  of  boundary elements  and  computational  nodes.  A  significant  acceleration  (up  to  52  times)  calculation  of  the  potential distribution  without  loss  in  accuracy  is  shown.  Acceleration  of up  to  22  times  was  achieved  in  calculation of mutual  influence  matrix  for  boundary  elements.  Using  CUDA  technology  allows  to  attain  significant acceleration without loss in accuracy and convergence. So application of CUDA is a good way to parallelizing BEM.  Application  of  developed  approach  allows  to  solve  problems in  different  areas  of  physics  such as acoustics, hydromechanics, electrodynamics, mechanics of solids and many other areas, efficiently.


Author(s):  
A N Borisov ◽  
E V Myasnikov

In this paper, we discuss various options for implementing the ”Kuznyechik” block encryption algorithm using the NVIDIA CUDA technology. We use lookup tables as a basis for the implementation. In experiments, we study the influence of the size of the block of threads and the location of lookup tables on the encryption speed. We show that the best results are obtained when the lookup tables are stored in the global memory. The peak encryption speed reaches 30.83 Gbps on the NVIDIA GeForce GTX 1070 graphics processor.


2020 ◽  
Vol 12 (0) ◽  
pp. 1-5
Author(s):  
Julija Semenenko ◽  
Aliaksei Kolesau ◽  
Vadimas Starikovičius ◽  
Artūras Mackūnas ◽  
Dmitrij Šešok

Overview of GPU usage while solving different engineering problems, comparison between CPU and GPU computations and overview of the heat conduction problem are provided in this paper. The Jacobi iterative algorithm was implemented by using Python, TensorFlow GPU library and NVIDIA CUDA technology. Numerical experiments were conducted with 6 CPUs and 4 GPUs. The fastest used GPU completed the calculations 19 times faster than the slowest CPU. On average, GPU was from 9 to 11 times faster than CPU. Significant relative speed-up in GPU calculations starts when the matrix contains at least 4002 floating-point numbers.


2008 ◽  
Author(s):  
David González ◽  
Christian Sánchez ◽  
Ricardo Veguilla ◽  
Nayda G. Santiago ◽  
Samuel Rosario-Torres ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document