A Novel Reputation-Based Ant Algorithm In Computing Grid Scheduling

How to schedule jobs is one of most important issues of grid. To address this problem, this paper presents a novel reputation-based ant algorithm in the computing grid scheduling. 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.