Performance of Parallel Distributed Bat Algorithm using MPI on a PC Cluster

Annals of Emerging Technologies in Computing

article

Noor, Fazal¹  Ibrahim, Abdulghani¹  AlKhattab, Mohammed M.¹ 

[1] Islamic University of Al-Madinah

关键词: Bat Algorithm;    Computational Complexity;    Distributed;    Message Passing Interface (MPI);    Optimization Algorithm;    Parallel;    PC Cluster;    Neural Networks;   

DOI  :  10.33166/AETiC.2020.01.003

学科分类：电子与电气工程

来源: International Association for Educators and Researchers (IAER)

【 摘 要 】

Optimization algorithms are often used to obtain optimal solutions to complex nonlinear problems and appear in many areas such as control, communication, computation, and others. Bat algorithm is a heuristic optimization algorithm and efficient in obtaining approximate best solutions to non-linear problems. In many situations complex problems involve large amount of computations that may require simulations to run for days or weeks or even years for an algorithm to converge to a solution. In this research, a Parallel Distributed Bat Algorithm (PDBA) is formulated using Message Passing Interface (MPI) in C language code for a PC Cluster. The time complexity of PDBA is determined and presented. The performance in terms of speed-up, efficiency, elapsed time, and number of times fitness function is executed is also presented.

【 授权许可】

CC BY