algorithm acceleration
Recently Published Documents


TOTAL DOCUMENTS

24
(FIVE YEARS 6)

H-INDEX

6
(FIVE YEARS 1)

2021 ◽  
Vol 35 (11) ◽  
pp. 1330-1331
Author(s):  
Stephen Kasdorf ◽  
Blake Troksa ◽  
Jake Harmon ◽  
Cam Key ◽  
Branislav Notaros

We present and discuss acceleration of a shooting and bouncing rays (SBR) algorithm for ray-tracing electromagnetic analysis of electrically very large structures such as underground mine tunnels at modern wireless communication frequencies. The acceleration is based on the parallelization of the SBR technique on NVIDIA GPUs using the OptiX application programming interface. The results show dramatic speedups of the parallel SBR algorithm compared with serial implementation.


2021 ◽  
Vol 336 ◽  
pp. 07011
Author(s):  
Xuefeng Yan ◽  
Yuqing Zhang ◽  
Arif Ali Khan

Repeated calculations lead to a sharp increase in the time of correlation-based feature selection. Incremental iteration has been applied in some algorithms to improve the efficiency. However, the computational efficiency of correlation has generally be ignored. An algorithm acceleration framework for correlation-based feature selection (AFCFS) is proposed. In AFCFS, the criterion of the feature selection will be analyzed and reconstructed based on entropy granularity, and the algorithm structure will also be adjusted accordingly. Specifically, all repeated part of calculation will be saved in mapping tables and can be accessed in next time directly, so as to further reduce the calculation repetition rate and improve the efficiency. The experimental results show that AFCFS can greatly reduce the cost time of these algorithms, and keep the corresponding classification accuracy basically unchanged.


IEEE Access ◽  
2017 ◽  
Vol 5 ◽  
pp. 2308-2318 ◽  
Author(s):  
Travis F. Collins ◽  
Alexander M. Wyglinski

Sign in / Sign up

Export Citation Format

Share Document