CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Shuffled Frog Leaping Algorithm in Distributed System

Published on July 2015 by S. Sarathambekai, K. Umamaheswari, G. Tharanipriya
journal_cover_thumbnail

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.

@article{
author = { S. Sarathambekai, K. Umamaheswari, G. Tharanipriya },
title = { Shuffled Frog Leaping Algorithm in Distributed System },
journal = { International Conference on Innovations in Computing Techniques (ICICT 2015) },
issue_date = { July 2015 },
volume = { ICICT2015 },
number = { 3 },
month = { July },
year = { 2015 },
issn = 0975-8887,
pages = { 12-15 },
numpages = 4,
url = { /proceedings/icict2015/number3/21469-1499/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 International Conference on Innovations in Computing Techniques (ICICT 2015)
%A S. Sarathambekai
%A K. Umamaheswari
%A G. Tharanipriya
%T Shuffled Frog Leaping Algorithm in Distributed System
%J International Conference on Innovations in Computing Techniques (ICICT 2015)
%@ 0975-8887
%V ICICT2015
%N 3
%P 12-15
%D 2015
%I International Journal of Computer Applications
Abstract

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.

References
  1. S. W. Choi, and Y. D. Kim, 2008 "Minimizing makespan on an m-machine re-entrant flow shop", Computers & Operations Research, Vol. 35, No. 5, pp. 1684–1696.
  2. DhodhiM K,Ahmad I,Yatama A,AhmadI, 2002 "An integrated technique for task matching and scheduling onto distributed heterogeneous computing systems. " Journal of Parallel and Distributed Computing, vol 62, pp 1338–61.
  3. Braun, T. , Siegal, H. , Beck, N, 2001," A comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems", Journal of Parallel and Distributed Computing, vol. 61, pp 810-837.
  4. Muzaffar M, Eusuffand Kevin E, Lansey, 2003, "Optimization of Water Distribution Network Design Using the Shuffled Frog Leaping Algorithm", Journal of Water Resources Planning and Management, Vol. 129, No. 3, pp. 210-225.
  5. S. Sarathambekai, K. Umamaheswari, 2014, "Task Scheduling in Distributed Systems using Discrete Particle Swarm Optimization", International Journal of Advanced Research in Computer Science and Software Engineering, Vol 4, pp 510-522.
  6. R. Lindeke, 2005, "Scheduling of Jobs", IE 3265 – POM, Spring:www. d. umn. edu/~rlindek1/. . . / Scheduling %20 of % 20Jobs_Sset11. ppt,.
  7. Xiao Qin and Hong Jiang, 2001, "Dynamic, Reliability-driven Scheduling of Parallel Real-time Jobs in Heterogeneous Systems", IEEE International conference on Parallel Processing, pp 113-122.
  8. I. Y. Kim and O. L. de Weck, 2006," Adaptive weighted sum method for multi-objective optimization: a new method for Pareto front generation", Springer-Structural and Multidisciplinary Optimization, Vol 31, pp 105-116.
Index Terms

Computer Science
Information Sciences

Keywords

Distributed System Pso Algorithm Sfl Scheduling