Link-Contention-Aware Genetic Scheduling Using Task Duplication in Grid Environments
In this paper, we consider the problem of scheduling precedence-constrained tasks as well as communications in the grid environment where computers and links are heterogeneous and time-sharing. Herein, we propose a novel genetic scheduling algorithm for grid computing. The new algorithm adopts a special chromosome encoding scheme in order to make better use of task duplication. Moreover, knowledge based genetic operators are developed to improve the performance of the algorithm. We perform comparison studies in a simulated grid environment. Experimental results show the effectiveness of the enhanced genetic scheduling algorithm.
KeywordsGenetic scheduling task duplication link contention
Unable to display preview. Download preview PDF.
- 1.Foster, I., Kesselman, C. (eds.): The Grid: Blueprint for a Future Computing Infrastucture. Morgan Kaufmann Publishers, Calif. (1998)Google Scholar
- 5.Sun, X., Wu, M.: Grid Harvest Service: A System for Long-Term, Application-Level Task Scheduling. In: Proceedings of 17th IPDPS, vol. 25 (2003)Google Scholar
- 9.Wang, L., Siegel, H.J., Roychowdhery, V.P., Maciejewski, A.: Task matching and scheduling in heterogeneous computing environments using a genetic-algorithm-based approach. JPDC 47, 8–22 (1997)Google Scholar
- 10.Ranaweera, S., Agrawal, D.P.: A Task Duplication Based Scheduling Algorithm for Heterogeneous Systems. In: Proceedings of 4th International Parallel and Distributed Processing Symposium, pp. 445–450 (2000)Google Scholar
- 11.Holland, J.: Adaptation in natural and artificial systems, 2nd edn. MIT Press, Cambridge (1992)Google Scholar
- 12.Casanova, H.: Simgrid: a Toolkit for the Simulation of Application Scheduling. In: Proceedings of the First IEEE/ACM International Symposium on Cluster Computing and the Grid, pp. 430–437 (2001)Google Scholar