Gravitational Attraction Search with Virtual Mass Gasvm to Solve Static Grid Job Scheduling Problem
-
2347
Downloads
-
3806
Views
Authors
Amin Jula
- Islamic Azad University, Mahshahr Branch
Narjes Khatoon Naseri
- Islamic Azad University, Shoushtar Branch
Amir Masood Rahmani
- Islamic Azad University, Tehran Science and Research Branch
Abstract
Achieving the most grid computing efficiency requires optimized job scheduling, that is a problem with vast search space and Attaining optimal solutions using deterministic algorithm is extremely difficult or impossible. Besides, Falling in the trap of local minima is considered to be one of the problems existing in gravitational attraction search. GASVM proposed two modifications. First, defining virtual mass (VM) for K best solutions. For each solution, VM is defined depends on mass and ranking in the sorted list of solutions. VMs will increase gravitational mass of proper solutions and attract others to them.
Second, we calculate gravitational force of just K proper solutions on the others to prevent current good solutions, more searching about, and attracting other solutions in the direction of them. In each modification, we obtain K by using roulette wheel algorithm. Analyzing the results of GASVM executions shows that the proposed algorithm is able to achieve its intended aims to modify gravitational attraction search algorithm.
Share and Cite
ISRP Style
Amin Jula, Narjes Khatoon Naseri, Amir Masood Rahmani, Gravitational Attraction Search with Virtual Mass Gasvm to Solve Static Grid Job Scheduling Problem, Journal of Mathematics and Computer Science, 1 (2010), no. 4, 305--312
AMA Style
Jula Amin, Naseri Narjes Khatoon, Rahmani Amir Masood, Gravitational Attraction Search with Virtual Mass Gasvm to Solve Static Grid Job Scheduling Problem. J Math Comput SCI-JM. (2010); 1(4):305--312
Chicago/Turabian Style
Jula, Amin, Naseri, Narjes Khatoon, Rahmani, Amir Masood. " Gravitational Attraction Search with Virtual Mass Gasvm to Solve Static Grid Job Scheduling Problem." Journal of Mathematics and Computer Science, 1, no. 4 (2010): 305--312
Keywords
- gravitational attraction search algorithm
- static job scheduling in grid
- Newton's gravitational law.
MSC
References
-
[1]
I. Foster, C. Kesselman, The Grid: Blueprint for a Future Computing Infrastructure, Morgan Kaufmann Publishers, 1999 (1999)
-
[2]
R.-S. Chang, J.-S. Chang, P.-S. Lin, An ant algorithm for balanced job scheduling in grids, Future Gener. Comput. Syst., 25 (2009), 20--27
-
[3]
K. S. Tang, K. F. Man, S. Kwong, Q. He, Genetic algorithms and their applications, IEEE Signal Process. Mag., 13 (1996),
-
[4]
S. Kirkpatrick, C. D. Gelatto, M. P. Vecchi, Optimization by simulated annealing, Science, 220 (1983), 671--680
-
[5]
J. D. Farmer, N. H. Packard, A. S. Perelson, The immune system, adaptation, and machine learning, Phys. D, 22 (1986), 187--204
-
[6]
M. Dorigo, V. Maniezzo, A. Colorni, The Ant System: optimization by a colony of cooperating agents, IEEE Transaction on systems, Man, and Cybernetics-part B, 26 (1996), 1--13
-
[7]
J. Kennedy, R. C. Eberhart, Particle swarm optimization, Proceedings of IEEE International Conference on Neural Networks, 4 (1995), 1942--1948
-
[8]
B. Webster, P. J. Bernhard, A local search optimization algorithm based on natural principles of gravitation, Florida Institute of Technology, 2003 (2003), 19 pages
-
[9]
J. Carretero, F. Xhafa, Use of genetic algorithms for scheduling jobs in large scale grid applications, Technological and Economic Development of Economy, XII (2006), 11--17
-
[10]
C. Voudouris, E. Tsang, Guided Local Search, Department of Computer Science (University of Essex), 1995 (1995), 18 pages
-
[11]
H. Saadi, G. Habibi, H. Mohammadi, Designing a scheduler for grid computing using genetic algorithm, Proceeding of 13th conference of Iranian Computer Association, 2007 (2007), pages