Abstract
In this paper, we propose a dynamic task scheduling algorithm which assigns tasks with precedence constraints to processors in a Grid computing system. The proposed scheduling algorithm bases on a modified static scheduling algorithm and takes into account the heterogeneous and dynamic natures of resources in Grid.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publishers, San Francisco (1999)
Banino, C., Beaumont, O., Legrand, A., Robert, Y.: Scheduling strategies for master-slave tasking on heterogeneous processor grids. In: Applied Parallel Computing: Advanced Scientific Computing: 6th Int’l Conf., June 2002, pp. 423–432 (2002)
Topcuoglu, H., Hariri, S., Wu, M.-Y.: Performance-Effective and Low- Complexity Task Scheduling for Heterogeneous Computing. IEEE Trans. Parallel and Distributed Systems 13(3), 260–274 (2002)
Liou, J.-C., Palis, M.A.: An Efficient Task Clustering Heuristic for Scheduling DAGs on Multiprocessors. In: Workshop on Resource Management, Symposium on Parallel and Distributed Processing (1996)
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
Zhang, Y., Inoguchi, Y., Shen, H. (2004). A Dynamic Task Scheduling Algorithm forGrid Computing System . In: Cao, J., Yang, L.T., Guo, M., Lau, F. (eds) Parallel and Distributed Processing and Applications. ISPA 2004. Lecture Notes in Computer Science, vol 3358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30566-8_69
Download citation
DOI: https://doi.org/10.1007/978-3-540-30566-8_69
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24128-7
Online ISBN: 978-3-540-30566-8
eBook Packages: Computer ScienceComputer Science (R0)