Title: Task allocation-based modified bacterial foraging algorithm for maximising reliability of a heterogeneous distributed system

Authors: Farid Abbache; Hamoudi Kalla

Addresses: Computer Science Department, LaSTIC Laboratory, University of Batna 2, Batna 05000, Algeria ' Computer Science Department, LaSTIC Laboratory, University of Batna 2, Batna 05000, Algeria

Abstract: modified bacterial foraging algorithm for allocation and scheduling tasks on processors and links with high reliability is proposed (MBFA). MBFA ensure high reliability without redundancy of processors or links by using an efficient and simple structure. MBFA is improved by adding an efficient model to deal with the weak solution (i.e., allocation with low reliability). Also a simulated annealing technique is integrated into MBFA in order to strengthen the search of best solution. The efficiency and effectiveness of MBFA are tested using random generated problems. MBFA is tested over the published approaches HPSO and GAA using density parameter (DS), number of nodes (N) and the communication to computation ratio parameter (CCR). The results show the superiority of MBFA over the published approaches in all test cases.

Keywords: task allocation; heterogeneous distributed system; reliability; bacterial foraging algorithm; simulated annealing algorithm.

DOI: 10.1504/IJCNDS.2019.101225

International Journal of Communication Networks and Distributed Systems, 2019 Vol.23 No.2, pp.252 - 273

Received: 05 Jun 2017
Accepted: 30 Mar 2018
Published online: 29 Jul 2019 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article