Abstract
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.
Supported by Shanghai Science and Technology Development Foundation under grant No. 03DZ15027 and the NSF of China under grant No. 60173033
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Foster, I., Kesselman, C. (eds.): The Grid: Blueprint for a Future Computing Infrastucture. Morgan Kaufmann Publishers, Calif. (1998)
Heymann, E., Senar, M.A., Luque, E., Livny, M.: Adaptive Scheduling for Master- Worker Applications on the Computational Grid. In: Buyya, R., Baker, M. (eds.) GRID 2000. LNCS, vol. 1971, pp. 214–227. Springer, Heidelberg (2000)
Yao, W., Li, B., You, J.: Genetic Scheduling on Minimal Processing Elements in the Grid. In: McKay, B., Slaney, J.K. (eds.) Canadian AI 2002. LNCS (LNAI), vol. 2557, pp. 465–476. Springer, Heidelberg (2002)
Wolski, R., Spring, N.T., Hayes, J.: The Network Weather Service: a distributed resource performance forecasting service for metacomputing. Journal of Future Generation Computing Systems 15, 757–768 (1999)
Sun, X., Wu, M.: Grid Harvest Service: A System for Long-Term, Application-Level Task Scheduling. In: Proceedings of 17th IPDPS, vol. 25 (2003)
Ullman, J.D.: NP-complete scheduling problems. Journal of Computing System Science 10, 384–393 (1975)
Kwok, Y.K., Ahmad, I.: Link contention-constrained scheduling and mapping of tasks and messages to a network of heterogeneous processors. Cluster Computing 3, 113–124 (2000)
Sih, G.C., Lee, E.A.: A compile-time scheduling heuristic for interconnectionconstrained heterogeneous processor architectures. IEEE Transactions on Parallel and Distributed Systems 4(2), 75–87 (1993)
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)
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)
Holland, J.: Adaptation in natural and artificial systems, 2nd edn. MIT Press, Cambridge (1992)
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)
Kwok, Y.K., Ahmad, I.: Benchmarking and comparison of the task graph scheduling algorithms. JPDC 59(3), 381–422 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yao, W., Xie, X., You, J. (2004). Link-Contention-Aware Genetic Scheduling Using Task Duplication in Grid Environments. In: Li, M., Sun, XH., Deng, Q., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24680-0_131
Download citation
DOI: https://doi.org/10.1007/978-3-540-24680-0_131
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21993-4
Online ISBN: 978-3-540-24680-0
eBook Packages: Springer Book Archive