Title: Performance comparison of discrete particle swarm optimisation and shuffled frog leaping algorithm in multiprocessor task scheduling problem

Authors: S. Sarathambekai; K. Umamaheswari

Addresses: Department of Information Technology, PSG College of Technology, Coimbatore, 641 004, Tamilnadu, India ' Department of Information Technology, PSG College of Technology, Coimbatore, 641 004, Tamilnadu, India

Abstract: Particle swarm optimisation (PSO) and Shuffled frog leaping (SFL) are Swarm Intelligence (SI) based algorithms. SI algorithms are stochastic based optimisation techniques that imitate process inspired from nature. This paper presents a comparative performance of two recent SI based optimisation algorithms such as discrete PSO (DPSO) and SFL in task scheduling problem. Task scheduling (TS) is a complex combinatorial optimisation problem and known to be NP-hard. It is an important challenging issue in distributed systems. Make span, mean flow time and reliability cost are performance criteria used to evaluate the efficiency of the DPSO and SFL algorithms for scheduling independent tasks in distributed systems. Computational simulations are done based on a set of benchmark instances to assess the performance of the algorithms.

Keywords: distributed systems; particle swarm optimisation; discrete PSO; DPSO; shuffled frog leaping algorithm; SLFA; swarm intelligence; task scheduling; metaheuristics; multiprocessor task scheduling; simulation.

DOI: 10.1504/IJAIP.2017.082972

International Journal of Advanced Intelligence Paradigms, 2017 Vol.9 No.2/3, pp.139 - 163

Received: 18 Jan 2016
Accepted: 31 May 2016

Published online: 01 Mar 2017 *

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