Using imperialist competition algorithm for independent task scheduling in grid computing

Journal of Intelligent and Fuzzy Systems

Volumn 27, Issue 1, 2014, Pages 187-199

  Pooranian, Zahra ^a   Shojafar, Mohammad ^b   Javadi, Bahman ^c   Abraham, Ajith ^d,e  

^a ISLAMIC AZAD UNIVERSITY   (Iran)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c UNIVERSITY OF WESTERN SYDNEY   (Australia)

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

^e VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

Author keywords

artificial intelligence algorithm; Grid computing; imperialist competition algorithm (ICA); independent task scheduling; scheduling

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; MULTITASKING; SCHEDULING; SCHEDULING ALGORITHMS;

ARTIFICIAL INTELLIGENCE ALGORITHMS; DISTRIBUTED COMPUTATIONS; GRID COMPUTING ENVIRONMENT; GRID RESOURCE SCHEDULING; HETEROGENEOUS RESOURCES; IMPERIALIST COMPETITION ALGORITHM (ICA); INDEPENDENT TASKS; LOCATION INDEPENDENT;

GRID COMPUTING;

EID: 84925365319     PISSN: 10641246     EISSN: 18758967     Source Type: Journal    
DOI: 10.3233/IFS-130988     Document Type: Article

References (39)

1. M.A. Azgomi and R. Eetezari-Maleki, Task scheduling modeling and reliability evaluation of grid services using colored Petri nets, Future Generation Computer Systems 26(8) (2010), 1141-1150.
2. th International Power System Conference (2011), 1-10.
3. th IEEE International Conference on Advanced Computing and Communications, India (2000), 1-8.
4. S.F. Attar, M. Mohammadi and R. Tavakkoli-Moghaddam, A novel imperialist competitive algorithm to solve flexible flow shop scheduling problem in order to minimize maximum completion time, International Journal of Computer Applications 28(10) (2011), 27-32.
5. E. Atashpaz-Gargari and C. Lucas, Designing an optimal PID controller using imperialist competitive algorithm, First Joint Congress on Fuzzy and Intelligent Systems (2007), 1-6.
6. E. Atashpaz-Gargari and C. Lucas, Imperialist competitive algorithm: An algorithm for optimization inspired by imperialist competitive, IEEE Congress on Evolutionary computation, Singapore (2007), 4661-4667.
7. J. Behnamian and M. Zandieh, A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties, Expert Systems with Applications 38(12) (2011), 14490-14498.
8. S. Benedict and V. Vasudevan, Improving scheduling of scientific workflows using Tabu search for computational grids, Information Technology Journal 7(1) (2008), 91-97.
9. B.T.B. Khoo and B. Veeravalli, Pro-active failure handling mechanisms for scheduling in grid computing environments, Journal of Parallel Distributed Computing 70 (2010), 189-200.
10. R. Buyya, The World-Wide Grid (WWG) (2002). http://www.buyya.com/ecogrid/wwg/
11. R. Chang, J. Chang and P. Lin, An ant algorithm for balanced job scheduling in grids, Future Generation Computer Systems 25(1) (2009), 20-27.
12. R. Chen, D. Shiau and S. Lo, Combined discrete particle swarm optimization and simulated annealing for grid computing scheduling problem, Lecture Notes in Computer Science, Springer 57 (2009), 242-251.
13. M. Cruz-Chavez, A. Rodriguez-Leon, E. Avila-Melgar, F. Juarez-Perez, M. Cruz-Rosales and R. Rivera-Lopez, Genetic-annealing algorithm in grid environment for scheduling problems, Security-Enriched Urban Computing and Smart Grid Communications in Computer and Information Science, Springer 78 (2010), 1-9.
14. B. Eksioglu, S.D. Eksioglu and P. Jain, A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods, Computers & Industrial Engineering 54(1) (2008), 1-11.
15. S. Garcia-Galan, R.P. Prado and J.E.M. Exposito, Fuzzy scheduling with swarm intelligence-based knowledge acquisition for grid computing, Engineering Applications of Artificial Intelligence 25(2) (2012), 359-375.
16. H. Izakian, B. TorkLadani, K. Zamanifar and A. Abraham, A novel particle swarm optimization approach for grid job scheduling, Communications in Computer and Information 31 (2009), 100-109.
17. th International Conference on Computer Science and Information Technology (2008), 623-627.
18. J. Kennedy and R. Mendes, Neighborhood topologies in fully informed and best-of-neighborhood particle swarms, IEEE Transactions on Systems, Man, and Cybernetics 36(4) (2006), 515-519.
19. J. Kołodziej and F. Xhafa, Meeting security and user behavior requirements in grid scheduling, Simulation Modeling Practice and Theory 19 (2011), 213-226.
20. J. Kołodziej and F. Xhafa, Enhancing the genetic-based scheduling in computational grids by a structured hierarchical population, Future Generation Computer Systems, Elsevier 27(8) (2011), 1035-1046.
21. J. Kołodziej and F. Xhafa, Integration of task abortion and security requirements in GA-based meta-heuristics for independent batch grid scheduling, Computers & Mathematics with Applications 63(2) (2012), 350-364.
22. S.K. Garg, R. Buyya and H.J. Siegel, Time and cost tradeoff management for scheduling parallel applications on utility grids, Future Generation Computer Systems 26(8) (2010), 1344-1355.
23. H. Liu, A. Abraham and A. Hassanien, Scheduling jobs on computational grids using a fuzzy particle swarm optimization algorithm, Future Generation Computer Systems 26(8) (2010), 1336-1343.
24. S.J.M. Rad, F.A. Tab and K. Mollazade, Application of imperialist competitive algorithm for feature selection: A case study on bulk rice classification, International Journal of Computer Applications 40(16) (2012), 41-48.
25. K. Nemati, S.M. Shamsuddin and M.S. Kamarposhti, Using imperial competitive algorithm for solving traveling salesman problem and comparing the efficiency of the proposed algorithm with methods in use, Australian Journal of Basic and Applied Sciences 5(10) (2011), 540-543.
26. Z. Pooranian, M. Shojafar, J.H. Abawajy and A. Abraham, An efficient meta-heuristic algorithm for grid computing, Journal of Combinatorial Optimization (JOCO) (2013), doi:10.1007/s10878-013-9644-6.
27. Z. Pooranian, A. Harounabadi, M. Shojafar and J. Mirabedini, Hybrid PSO for independent task scheduling in grid computing to decrease makespan, International Conference on Future Information Technology IPCSIT 13, Singapore (2011), 435-439.
28. Z. Pooranian, A. Harounabadi, M. Shojafar and N. Hedayat, New hybrid algorithm for task scheduling in grid computing to decrease missed task, world academy of science, Engineering and Technology 79 (2011), 924-928.
29. Z. Pooranian, M. Shojafar and B. Javadi, Independent task scheduling in grid computing based on queen-bee algorithm, IAES International Journal of Artificial Intelligence (IJ-AI) 1(4) (2012), 171-181.
30. Z. Pooranian, M. Shojafar, R. Tavoli, M. Singhal and A. Abraham, A hybrid meta-heuristic algorithm for job scheduling on computational grids, Informatica 37 (2013), 501-505.
31. A.S. Mamaghani and M.R. Meybodi, An application of imperialist competitive algorithm to solve the quadratic assignment problem, International Conference Internet Technology and Secured Transactions (ICITST) (2011), 562-565.
32. R. Shafaei, N. Moradinasab and M. Rabiee, Efficient meta heuristic algorithms to minimize mean flow time in no-wait two stage flow shops with parallel and identical machines, International Journal of Management Science and Engineering Management (2011), 421-430.
33. E. Shokrollahpour, M. Zandieh and B. Dorri, A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem, International Journal of Production Research 49(11) (2011), 3087-3103.
34. Q. Tao, H. Chang, Y. Yi, C.H. Gu and W. Li, A rotary chaotic PSO algorithm for trustworthy scheduling of a grid workflow, Computers & Operations Research 38(5) (2011), 824-836.
35. L.Y. Tseng, Y.H. Chin and S.C. Wang, The anatomy study of high performance task scheduling algorithm for grid computing system, Computer Standards & Interfaces, Elsevier 31(4) (2009), 713-722.
36. L.Wei, X. Zhang, Y. Li and Yu Li, An improved ant algorithm for grid task scheduling strategy, Physics Procedia, Elsevier 24 (2012), 1974-1981.
37. C. Weng and X. Lu, Heuristic scheduling for bag-of-tasks applications in combination with QoS in the computational grid, Future Generation Computer Systems 21(2) (2005), 271-280.
38. F. Xhafa and A. Abraham, Computational models and heuristic methods for Grid scheduling problems, Future Generation Computer Systems 70(3) (2010), 608-621.
39. F. Xhafa, J. Gonzalez, K. Dahal and A. Abraham, A GA(TS) hybrid algorithm for scheduling in computational grids, Hybrid Artificial Intelligence Systems Lecture Notes in Computer Science, Springer 5572 (2009), 285-292.