Abstract
The objective of the task scheduling is to achieve the minimum execution time of all the tasks with their precedence requirements satisfied. Although several task scheduling heuristics for the heterogeneous environment have been presented in the literature, they overlook the various type of network and do not perform efficiently on such an environment. We present the new scheduling heuristic which is named the ‘k-Depth Look-ahead.’ The proposed heuristic takes the network heterogeneity into consideration and our experimental study shows that the proposed heuristic generates a better schedule especially under the condition that the network resource costs high.
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
Almeida, V.A.F., Vasconcelos, I.M.M., Arabe, J.N.C., Menasce, D.A.: Using Random Task Graphs to Investigate the Potential Benefits of Heterogeneity in Parallel Systems. In Proceedings Supercomputing’ 92, pages 683–691, 1992. IEEE
El-Rewini, H., Lewis, T., Ali, H.: Task Scheduling in Parallel and Distributed Systems. Prentice Hall, Englewood Cliffs, New Jersey, 1994
Kwok, Y., Ahmad, I.: Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors. ACM Computing Surveys, 31(4):406–471, 1999
Kwok, Y., Ahmad, I.: Link Contention-Constrained Scheduling and Mapping of Tasks and Messages to a Network of Heterogeneous Processors. Cluster Computing, 3(2):113–124, 2000
Radulescu, A., van Gemund, A.J.C.: Fast and Effective Task Scheduling in Heterogeneous Systems. In the 9th Heterogeneous Computing Workshop (HCW), pages 229–238, May 2000.
Shirazi, B., Wang, M., Pathak, G.: Analysis and Evaluation of Heuristic Methods for Static Scheduling. J. Parallel and Distributed Computing,(10):222–232, 1990
Sih, G.C., Lee, E.A.: A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures. IEEE Transactions on Parallel and Distributed Systems, 4(2):75–87, Feb 1993
Topcuoglu, H., Hariri, S., Wu, M.: Task Scheduling Algorithms for Heterogeneous Processors. In the 8th IEEE Workshop on Heterogeneous Computing Systems, Apr 1999.
Yang, T., Gerasoulis, A.: List Scheduling with and without Communication. Parallel Computing Journal (19):1321–1344, 1993
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Woo, N., Yeom, H.Y. (2002). k-Depth Look-Ahead Task Scheduling in Network of Heterogeneous Processors. In: Chong, I. (eds) Information Networking: Wireless Communications Technologies and Network Applications. ICOIN 2002. Lecture Notes in Computer Science, vol 2344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45801-8_69
Download citation
DOI: https://doi.org/10.1007/3-540-45801-8_69
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44255-4
Online ISBN: 978-3-540-45801-2
eBook Packages: Springer Book Archive