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

Enhanced Particle Swarm Optimization with Uniform Mutation and SPV Rule for Grid Task Scheduling

by Ishita Dubey, Manish Gupta
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 116 - Number 15
Year of Publication: 2015
Authors: Ishita Dubey, Manish Gupta
10.5120/20410-2781

Ishita Dubey, Manish Gupta . Enhanced Particle Swarm Optimization with Uniform Mutation and SPV Rule for Grid Task Scheduling. International Journal of Computer Applications. 116, 15 ( April 2015), 14-17. DOI=10.5120/20410-2781

@article{ 10.5120/20410-2781,
author = { Ishita Dubey, Manish Gupta },
title = { Enhanced Particle Swarm Optimization with Uniform Mutation and SPV Rule for Grid Task Scheduling },
journal = { International Journal of Computer Applications },
issue_date = { April 2015 },
volume = { 116 },
number = { 15 },
month = { April },
year = { 2015 },
issn = { 0975-8887 },
pages = { 14-17 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume116/number15/20410-2781/ },
doi = { 10.5120/20410-2781 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:57:10.981711+05:30
%A Ishita Dubey
%A Manish Gupta
%T Enhanced Particle Swarm Optimization with Uniform Mutation and SPV Rule for Grid Task Scheduling
%J International Journal of Computer Applications
%@ 0975-8887
%V 116
%N 15
%P 14-17
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Grid computing which is based on the high performance computing environment, basically used for solving complex computational demands. In the grid computing environment, scheduling of tasks is a big challenge. The task scheduling problem can be defined as a problem of assigning the number of resources to tasks where number of resources is less than the number of available tasks. Particle swarm optimization (PSO) algorithm is one of the heuristic search based optimization technique. It is an effective optimization technique for different continuous optimization problems. In this work, modified version of PSO algorithm with smallest position value (SPV) is used and implemented on grid task scheduling problem. Here in the modified PSO algorithm, one additional phase in the form of mutation operator is used and smallest position value is used for enhancing local search. Proposed work is compared with the genetic algorithm and PSO algorithm. Experimental results show that the proposed work is better than previous algorithms.

References
  1. J. Kennedy and R. Eberhart, Particle swarm optimization, in Proc. IEEEInternational Conference Neural Networks, vol. 4, 1995, pp. 1942 – 1948.
  2. Y. Shi and R. C. Eberhart, A modified particle swarm optimizer, in Proc. IEEE International Conference on Evolutionary Computation, Piscataway,NJ, 1998, IEEE Press, pp. 69-73.
  3. R. C. Eberhart and Y. Shi, Comparing inertia weights and constrictionfactors in particle swarm optimization, 2000 Congress on EvolutionaryComputing, vol. 1, 2000, pp. 84-88.
  4. R. A. Krohling. Gaussian particle swarm with jumps. Proc. of the 2005 IEEE Congr. on Evol. Comput. , pp. 1226-1231, 2005.
  5. N. Higashi and H. Iba. Particle swarm optimization with Gaussian mutation, Proc. of the 2003 IEEE Swarm Intelligence Symphosium, pp. 72-79, 2003.
  6. S. C. Esquivel and C. A. Coello Coello. On the use of particle swarm optimization with multimodal functions, Proc. of the 2003 IEEE Congr. on Evol. Comput. , pp. 1130-1136, 2003.
  7. R. A. Krohling and L. dos Santos Coelho. PSO-E: Particle swarm with exponential distribution. Proc. of the 2006 IEEE Congr. on Evol. Comput. , pp. 1428-1433, 2006.
  8. C. Li, Y. Liu, L. Kang, and A. Zhou. A Fast Particle Swarm Optimization Algorithm with Cauchy Mutation and Natural Selection Strategy. ISICA2007, LNCS4683, pp. 334-343, 2007.
  9. H. Wang, Y. Liu, C. Li, and S. Zeng, A Hybrid Particle Swarm Algorithm with Cauchy Mutation, Proc. of the 2007 IEEE Swarm Intelligence Symposium, 2007.
  10. H. Wang, Y. Liu, S. Zeng, and C. Li. Opposition-based Particle Swarm Algorithm with Cauchy Mutation. Proc. of the 2007 IEEE Congr. on Evol. Comput. , 2007.
  11. G-. G. Jin, S-. R. Joo. A Study on a Real-Coded Genetic Algorithm. Journal of Control, Automation, and Systems Engineering, vol. 6, no. 4, pp. 268-274, April 2000.
  12. H. Miihlenbein and D. Schlierkamp-Voosen. Predictive Models for the Breeder Genetic Algorithm: I. Continuous Parameter Optimization. Evolutionary Computation, vol. 1, pp. 25-49, I993.
  13. Z. Michalewicz. Genetic algorithm + data structure = evolution pmgram. Springer-Verlag, Inc. , Heidelberg, Berlin, 1996.
  14. L. J. Eshelman, R. A. Caruana, and J. D. Schaffer. Bases in the crossover landscape. Pmc. 3rd Int. Con$ on Genetic Algorithms, J. Schaffer(Ed. ), Morgan Kaufmann Publishers, LA, pp. 10-19, 1989.
  15. L. Zhang, Y. Chen, R. sun. S. Jing & B. Yang," A Task Scheduling Algorithm based on PSO for Grid Computing", International journal of Computational Intelligence Research, vol. 4, No. 1 (2008), pp. 37-43.
Index Terms

Computer Science
Information Sciences

Keywords

Particle Swarm Optimization Genetic Algorithm SPV rule Mutation Grid task scheduling PSO.

Powered by PhDFocusTM