International Conference on Innovations in Computing Techniques (ICICT 2015) |
Foundation of Computer Science USA |
ICICT2015 - Number 3 |
July 2015 |
Authors: S. Sarathambekai, K. Umamaheswari, G. Tharanipriya |
cff9af4c-5777-4b82-a8f2-f3e8b497b2a3 |
S. Sarathambekai, K. Umamaheswari, G. Tharanipriya . Shuffled Frog Leaping Algorithm in Distributed System. International Conference on Innovations in Computing Techniques (ICICT 2015). ICICT2015, 3 (July 2015), 12-15.
The general problem of multiprocessor scheduling is stated as scheduling tasks on a multiprocessor system so that a set of performance criteria can be optimized. Shuffled Frog Leaping (SFL) algorithm is a recently developed population based search algorithm, which is inspired by the interactive behavior and global exchange of information of frogs searching for food. It is combination of meme-based genetic algorithm or Memetic Algorithm (MA) and Particle Swarm Optimization (PSO). This algorithm is used in this paper to solve a task scheduling problem in distributed systems which aims at minimizing the tri-objectives such as makespan, flow time and reliability cost.