Research on Distributed Multiprocessor Scheduling Based on the Ant Colony Algorithm
Xiaohong Kong · Computer Engineering and Science · 2007
This paper introduces the ant colony algorithm to solve the distributed system scheduling problem with arbitrary task graphs.The ant colony algorithm is a novel constructive heuristic approach to optimizing discrete space functions.Distributed system scheduling is a NP-hard problem.In this paper we present a problem priority-based heuristic method,which can enhance algorithm performance.The results for arbitrary task graphs are compared to simulate the annealing algorithm and other algorithms.