Independent Tasks Scheduling Based on Genetic Algorithm in Cloud Computing
- 1 September 2009
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Task scheduling algorithm, which is an NP-completeness problem, plays a key role in cloud computing systems. In this paper, we propose an optimized algorithm based on genetic algorithm to schedule independent and divisible tasks adapting to different computation and memory requirements. We prompt the algorithm in heterogeneous systems, where resources (including CPUs) are of computational and communication heterogeneity. Dynamic scheduling is also in consideration. Though GA is designed to solve combinatorial optimization problem, it's inefficient for global optimization. So we conclude with further researches in optimized genetic algorithm.Keywords
This publication has 4 references indexed in Scilit:
- A New Strategy for Improving the Effectiveness of Resource Reclaiming Algorithms in Multiprocessor Real-Time SystemsJournal of Parallel and Distributed Computing, 2000
- A genetic algorithm approach to a general category project scheduling problemIEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 1999
- Dynamic scheduling system utilizing machine learning as a knowledge acquisition toolInternational Journal of Production Research, 1992
- Efficient scheduling algorithms for real-time multiprocessor systemsIEEE Transactions on Parallel and Distributed Systems, 1990