Dynamic Task Scheduling using Genetic Algorithms for Heterogeneous Distributed Computing

An algorithm has been developed to dynamically schedule heterogeneous tasks on heterogeneous processors in a distributed system. The scheduler operates in an environment with dynamically changing resources and adapts to variable system resources. It operates in a batch fashion and utilises a genetic algorithm to minimise the total execution time. We have compared our scheduler to six other schedulers, three batch-mode and three immediate-mode schedulers. We have performed simulations with randomly generated task sets, using uniform, normal, and Poisson distributions, whilst varying the communication overheads between the clients and scheduler. We have achieved more efficient results than all other schedulers across a range of different scenarios while scheduling 10,000 tasks on up to 50 heterogeneous processors.

• Type: Conference
• Year: 2005
• Where: IPPS
• Authors: Andrew J. Page, Thomas J. Naughton
• Keywords: Distributed And Parallel Computing, Heterogeneous Processors, Heterogeneous Tasks, Immediate-mode Schedulers, IPPS 2005