A discrete particle swarm optimization approach for grid job scheduling

International Journal of Innovative Computing, Information and Control

Volumn 6, Issue 9, 2010, Pages 4219-4234

  Izakian, Hesam ^a,b   Ladani, Behrouz Tork ^a   Abraham, Ajith ^b   Snášel, Václav ^c  

^a UNIVERSITY OF ISFAHAN   (Iran)

^b SCIENTIFIC NETWORK FOR INNOVATION AND RESEARCH EXCELLENCE   (United States)

^c VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

Author keywords

Flowtime; Grid computing; Makespan; Particle swarm optimization; Scheduling

Indexed keywords

COMPUTATIONAL SYSTEM; DIFFERENT SERVICES; DISCRETE PARTICLE SWARM OPTIMIZATION; DYNAMIC NATURE; EXPERIMENTAL STUDIES; FLOW-TIME; GRID ENVIRONMENTS; GRID SCHEDULING; JOB SCHEDULING; MAKESPAN; META HEURISTIC ALGORITHM; MINIMIZING MAKESPAN; NEAR-OPTIMAL SOLUTIONS; PARTICLE SWARM; SEARCH ALGORITHMS; SEARCH SPACES; SOCIAL BEHAVIOR; TRADITIONAL SYSTEMS;

PARTICLE SWARM OPTIMIZATION (PSO); SCHEDULING; SCHEDULING ALGORITHMS;

GRID COMPUTING;

EID: 79955465206     PISSN: 13494198     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (40)

1. I. Foster, C. Kesselman and S. Tuecke, The anatomy of the grid: Enabling scalable virtual organizations, International Journal of High Performance Computing Applications, vol.15, no.3, pp.200-222, 2001.
2. J.-K. Kim, S. Shivle, H. J. Siegel, A. A. Maciejewski, T. D. Braun, M. Schneider, S. Tideman, R. Chitta, R. B. Dilmaghani, R. Joshi, A. Kaul, A. Sharma, S. Sripada, P. Vangari and S. S. Yellampalli, Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment, J. Parallel Distrib. Comp., vol.67, no.2, pp.154-169, 2007.
3. J. Cao, Agent-based Resource Management for Grid Computing, Ph.D. Thesis, Department of Computer Science University of Warwick, London, 2001.
4. R. Buyya, Economic-based Distributed Resource Management and Scheduling for Grid Computing, Ph.D. Thesis, School of Computer Science and Software Engineering Monash University, Melbourne, 2002.
5. Y. He, H. Liu, W. Wen and H. Jin, A preference method with fuzzy logic in service scheduling of grid computing, Lecture Notes in Computer Science, vol.3613, pp.865-871, 2005.
6. C. Wang, C. Jiang and X. Liu, Fuzzy logic-based secure and fault tolerant job scheduling in grid, Tsinghua Science and Technology, vol.12, supplement 1, pp.45-50, 2007.
7. K. P. Kumar, A. Agarwal and R. Krishnan, Fuzzy based resource management framework for high throughput computing, Proc. of the 4th IEEE International Symposium on Cluster Computing and the Grid, Chicago, IL, vol.3, pp.555-562, 2004.
8. E. G. Coffman, Computer and Job-Shop Scheduling Theory, John Wiley & Sons Inc, New York, 1976.
9. R. Zhang and C. Wu, Bottleneck machine identification based on optimization for the job shop scheduling problem, ICIC Express Letters, vol.2, no.2, pp.175-180, 2008.
10. A. Yarkhan and J. Dongarra, Experiments with scheduling using simulated annealing in a grid environment, Proc. of the 3rd International Workshop on Grid Computing, LNCS 2536, pp.232-242, 2002.
11. W. Pang, K. Wang, C. Zhou and L. Dong, Fuzzy discrete particle swarm optimization for solving traveling salesman problem, Proc. of the 4th International Conference on Computer and Information Technology, pp.796-800, 2004.
12. H. Izakian, A. Abraham and V. Snášel, Performance comparison of six efficient pure heuristics for scheduling meta-tasks on heterogeneous distributed environments, Neural Network World, vol.19, no.6, pp.695-710, 2009.
13. J. Page and J. Naughton, Framework for task scheduling in heterogeneous distributed computing using genetic algorithms, Artif. Intell. Rev, vol.24, no.3-4, pp.415-429, 2005.
14. S. Ali, T. D. Braun, H. J. Siegel, A. A. Maciejewski, N. Beck, L. Boloni, M. Maheswaran, A. I. Reuther, J. P. Robertson, M. D. Theys and B. Yao, Characterizing resource allocation heuristics for heterogeneous computing systems, in Advances in Computers Volume 63, Parallel, Distributed, and Pervasive Computing, A. R. Hurson (ed.), Elsevier, 2005.
15. T. D. Braun, H. J. Siege, N. Beck, L. L. Boloni, M. Maheswaran, A. I. Reuther, J. P. Robertson, M. D. Theys and B. Yao, A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems, J. Parall. Distrib. Comp., vol.61, no.6, pp.810-837, 2001.
16. H. Liu, A. Abraham and A. E. Hassanien, Scheduling jobs on computational grids using a fuzzy particle swarm optimization algorithm, Future Generation Computer Systems, 2009, in press.
17. J. Kennedy and R. C. Eberhart, Particle swarm optimization, Proc. of the IEEE International Conference on Neural Networks, pp.1942-1948, 1995.
18. SETI, http://setiathome.ssl.berkeley.edu.
19. J. Kennedy, Small worlds and mega-minds: Effects of neighborhood topology on particle swarm performance, Proc. of the Congress on Evolutionary Computation, Washington DC, USA, pp.1931-1938, 1999.
20. R. C. Eberhart and Y. Shi, Evolving artificial neural networks, Proc. of the International Conference on Neural Networks and Brain, Beijing, China, pp.PL5-PL13, 1998.
21. R. C. Eberhart and J. Kennedy, A new optimizer using particle swarm theory, Proc. of the 6th International Symposium on Micromachine and Human Science, pp.39-43, 1995.
22. J. Kennedy and R. C. Eberhart, A discrete binary version of the particle swarm algorithm, IEEE International Conference on Systems, Man, and Cybernetics, Orlando, FL, vol.5, pp.4104-4108, 1997.
23. S. Kirkpatrick, C. Gelatt Jr. and M. Vecchi, Optimization by simulated annealing, Science, vol.220, no.4598, pp.671-680, 1983.
24. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison Wesley, Reading, 1997.
25. A. Salman, I. Ahmad and S. Al-Madani, Particle swarm optimization for task assignment problem, Microprocessors and Microsystems, vol.26, no.8, pp.363-371, 2002.
26. M. Dorigo, Optimization, Learning, and Natural Algorithms, Ph.D. Thesis, Dip. Elettronica e Informazione, Politecnico di Milano, Italy, 1992.
27. M. Litzkow, M. Livny and M. W. Mutka, Condor-a hunter of idle workstations, Proc. of the 8th Int'l Conf. Distributed Computing Systems, San Jose, CA, pp.104-111, 1988.
28. A. Abraham, R. Buyya and B. Nath, Nature's heuristics for scheduling jobs on computational grids, Proc. of the 8th IEEE International Conference on Advanced Computing and Communications, India, pp.45-52, 2000.
29. J. Carretero, F. Xhafa and A. Abraham, Genetic algorithm based schedulers for grid computing, International Journal of Innovative Computing, Information and Control, vol.3, no.5, pp.1053-1071, 2007.
30. J. Li, D. Wan, Z. Chi and X. Hu, An efficient fine-grained parallel particle swarm optimization method based on GPU-acceleration, International Journal of Innovative Computing, Information and Control, vol.3, no.6(B), pp.1707-1714, 2007.
31. X. Cai, Z. Cui, J. Zeng and Y. Tan, Particle swarm optimization with self-adjusting cognitive selection strategy, International Journal of Innovative Computing, Information and Control, vol.4, no.4, pp.943-952, 2008.
32. R. C. Eberhart, P. K. Simpson and R. W. Dobbins, Computational Intelligence PC Tools, Academic Press Professional, San Diego, 1996.
33. J. Salerno, Using the particle swarm optimization technique to train a recurrent neural model, Proc. of the 9th IEEE International Conference on Tools with Artificial Intelligence, Newport Beach, CA, pp.45-49, 1997.
34. J. Kennedy, The particle swarm: Social adaptation of knowledge, Proc. of the IEEE International Conference on Evolutionary Computation, Indianapolis, IN, pp.303-308, 1997.
35. F. Xhafa, B. Duran, A. Abraham and K. Dahal, Tuning struggle strategy in genetic algorithms for scheduling in computational grids, Neural Network World, vol.18, no.3, pp.209-225, 2008.
36. G. Ritchie and J. Levine, A hybrid ant algorithm for scheduling independent jobs in heterogeneous computing environments, Proc. of the 23rd Workshop of the UK Planning and Scheduling Special Interest Group, Cork, Ireland, pp.1-7, 2004.
37. J. Cowie, B. Dodson, R.-M. Elkenbracht-Huizing, A. K. Lenstra, P. L. Montgomery and J. Zayer, A world wide number field sieve factoring record: On to 512 bits, Advances in Cryptology-Proc. Int. Conf. Theory and Applications of Cryptology and Information Security, LNCS 1163, pp.382-394, 1996.
38. Prime, http://www.mersenne.org.
39. F. Berman, R. Wolski, H. Casanova, W. Cirne, H. Dail, M. Faerman, S. Figueira, J. Hayes, G. Obertelli, J. Schopf, G. Shao, S. Smallen, N. Spring, A. Su and D. Zagorodnov, Adaptive computing on the grid using AppLeS, IEEE Trans. Parallel and Distributed Systems, vol.14, no.4, pp.369-382, 2003.
40. Z. Cui, J. Zeng and G. Sun, Levy velocity threshold particle swarm optimization, ICIC Express Letters, vol.2, no.1, pp.23-28, 2008.