Affiliation:
1. National Technical University of Athens, Greece
Abstract
Job scheduling in grid computing is a very important problem. To utilize grids efficiently, we need a good job scheduling algorithm to assign jobs to resources in grids. The main scope of this paper is to propose a new Ant Colony Optimization (ACO) algorithm for balanced job scheduling in the Grid environment. To achieve the above goal, we will indicate a way to balance the entire system load while minimizing the makespan of a given set of jobs. Based on the experimental results, the proposed algorithm confidently demonstrates its practicability and competitiveness compared with other job scheduling algorithms.
Reference55 articles.
1. Abramson, D., Giddy, J., & Kotler, L. (2000, May). High performance parametric modeling with Nimrod/G: Killer application for the global Grid. In Proceedings of the 14th International Symposium on Parallel and Distributed Processing (IPDPS 2000), Cancun, Mexico (pp. 520-528). Washington, DC: IEEE Computer Society.
2. Armstrong, R., Hensgen, D., & Kidd, T. (1998, March 30). The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions. In Proceedings of the 7th IEEE Heterogeneous Computing Workshop, Orlando, FL (pp. 79-87). Washington, DC: IEEE Computer Society.
3. Beni, G., & Wang, J. (1989, June). Swarm intelligence in cellular robotic systems. Paper presented at the NATO Advanced Workshop on Robots and Biological Systems, Toscana, Italy.
4. Feature Article—The Ellipsoid Method: A Survey
5. BOINC. (2009). Berkeley open infrastructure for network computing. Retrieved from http://boinc.berkeley.edu