Abstract
Distributed computing environments are well suited to meet the computational demands of diverse groups of tasks. At present the most popular model characterizing task’s precedence is DAG (directed acyclic graph). In [2], a novel model called TTIG (Temporal Task In Interaction Graph)that is more realistic and universal than DAG and its corresponding algorithm called MATE are presented. This paper extends TTIG model and proposes a new static scheduling algorithm called GBHA (group-based hybrid algorithm) that eliminates cycles when traversing TTIG, so that global information can be captured. Simulation results show that our algorithm outperforms MATE significantly in homogeneous systems.
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.
References
Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the Theory of NPCompleteness. W.H.Freeman and Co., New York (1979)
Roig, C., Ripoll, A., Senar, M., Guirado, F., Luque, E.: A new model for static mapping of parallel applications with task and date parallelism. In: IEEE Proceedings of the International Parallel and Distributed Processing Symposium, pp. 78–85 (2002)
Tan, M., Sigle, H.J., Antonio, J.K., Li, Y.A.: Minimizing the application execution time through scheduling of subtasks and communication traffic in a heterogeneous computing system. IEEE Trans. on Parallel and Distributed Systems 8(8), 857–871 (1997)
Topcuoglu, H., Hariri, S., Wu, M.-Y.: Task scheduling algorithms for heterogeneous processors. In: Proc. Heterogeneous Computing Workshops (1999)
Radulescu, A., van Gemund, A.J.C.: Low-cost Task Scheduling for Distributed-Memory Machines. IEEE Transactions on Parallel and Distributed Systems 13(6), 648–658 (2002)
A New Static Task Scheduling Algorithm in Homogeneous Computing Environments. Mini-Micro Systems (to appear)
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
Han, JJ., Li, QH. (2004). A New Task Scheduling Algorithm in Distributed Computing 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_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-24680-0_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21993-4
Online ISBN: 978-3-540-24680-0
eBook Packages: Springer Book Archive