Dataflow in MATLAB: Algorithm Acceleration Through Concurrency

Graphics Processing Units (GPUs) have been evolving very fast, turning into high performance programmable processors. Though GPUs have been designed to compute graphics algorithms, their power and flexibility makes them a very attractive platform for generalpurpose computing. In the last years they have been used to accelerate calculations in physics, computer vision, artificial intelligence, database operations, etc. (Owens, 2007). In this paper an approach to general purpose computing with GPUs is made, followed by a description of artificial intelligence algorithms based on Artificial Neural Networks (ANN) and Evolutionary Computation (EC) accelerated using GPU.

Download Full-text

Shooting-Bouncing-Rays Technique to Model Mine Tunnels: Algorithm Acceleration

2020 International Applied Computational Electromagnetics Society Symposium (ACES) ◽

10.23919/aces49320.2020.9196048 ◽

2020 ◽

Author(s):

Stephen Kasdorf ◽

Blake Troksa ◽

Jake Harmon ◽

Cam Key ◽

Branislav M. Notaros

Keyword(s):

Algorithm Acceleration ◽

Mine Tunnels

Download Full-text

An algorithm acceleration framework for correlation-based feature selection

MATEC Web of Conferences ◽

10.1051/matecconf/202133607011 ◽

2021 ◽

Vol 336 ◽

pp. 07011

Author(s):

Xuefeng Yan ◽

Yuqing Zhang ◽

Arif Ali Khan

Keyword(s):

Feature Selection ◽

Computational Efficiency ◽

Repetition Rate ◽

Classification Accuracy ◽

Sharp Increase ◽

Experimental Results ◽

Algorithm Acceleration ◽

Correlation Based Feature Selection ◽

The Cost

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.

Download Full-text

Algorithm Acceleration of Compressed Sensing with Cloud

Information Technology Journal ◽

10.3923/itj.2014.269.277 ◽

2014 ◽

Vol 13 (2) ◽

pp. 269-277

Author(s):

Zhang Yong-Ping ◽

Zhang Gong-Xuan ◽

Zhu Zhao-Meng

Keyword(s):

Compressed Sensing ◽

Algorithm Acceleration

Download Full-text

Shooting-Bouncing-Rays Technique to Model Mine Tunnels: Algorithm Acceleration

Applied Computational Electromagnetics Society ◽

10.47037/2020.aces.j.351134 ◽

2021 ◽

Vol 35 (11) ◽

pp. 1330-1331

Author(s):

Stephen Kasdorf ◽

Blake Troksa ◽

Jake Harmon ◽

Cam Key ◽

Branislav Notaros

Keyword(s):

Wireless Communication ◽

Ray Tracing ◽

Application Programming Interface ◽

Underground Mine ◽

Electromagnetic Analysis ◽

Large Structures ◽

Algorithm Acceleration ◽

Application Programming ◽

Programming Interface ◽

Mine Tunnels

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.

Download Full-text