Powered Grid Scheduling by Ant Algorithm
The grid environment has the characteristics of distribution, dynamic and heterogeneous. How to schedule jobs is one of most important issues of computing grid. To address this problem, this paper presents a novel reputation-based ant algorithm in the computing grid scheduling. The reputation is a comprehensive measure and used to reflect the ability of compute node or network for a long-running stability. The reputation-based ant algorithm introduce reputation index both in tasks and resources to the local and global pheromone. Experimental results show that the reputation-based ant algorithm outperforms Round Robin, Min-Min, and reputation based Min-Min in makespan and system load balancing.
Keywordsimproved ACS reputation grid scheduling SimGrid
Unable to display preview. Download preview PDF.
- 3.Zhang, W.Z., Fang, B.X., et al.: A Trust-QoS Enhanced Grid Service Scheduling. Chinese Journal of Computers 7, 1157–1166 (2006)Google Scholar
- 9.Xu, Z., Hou, X., Sun, J.: Ant Algorithm-Based Task Scheduling in Grid Computing. In: Canadian Conference on Electrical and Computer Engineering, IEEE CCECE (2003)Google Scholar
- 11.Sathish, K., Reddy, A.R.M.: Enhanced Ant Algorithm Based Load Balanced Task Scheduling in Grid Computing. International Journal of Computer Science and Network Security 8(10), 219–223 (2008)Google Scholar
- 13.Casanova, H., Legrand, A., Quinson, M.: SimGrid: A Generic Framework for Large-Scale Distributed Experiments. In: Tenth International Conference on Computer Modeling and Simulation (uksim 2008) 126–131 (2008)Google Scholar