Abstract
The problem of scheduling a weighted directed acyclic graph (DAG) representing an application to a set of heterogeneous processors to minimize the completion time has been recently studied. The NP-completeness of the problem has instigated researchers to propose different heuristic algorithms. In this paper, we present a Generalized Critical-task Anticipation (GCA) algorithm for DAG scheduling in heterogeneous computing environment. The GCA scheduling algorithm employs task prioritizing technique based on CA algorithm and introduces a new processor selection scheme by considering heterogeneous communication costs among processors for adapting grid and scalable computing. To evaluate the performance of the proposed technique, we have developed a simulator that contains a parametric graph generator for generating weighted directed acyclic graphs with various characteristics. We have implemented the GCA algorithm along with the CA and HEFT scheduling algorithms on the simulator. The GCA algorithm is shown to be effective in terms of speedup and low scheduling costs.
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
Bajaj, R., Agrawal, D.P.: Improving Scheduling of Tasks in a Heterogeneous Environment. IEEE Trans. on PDS 15(2), 107–118 (2004)
Behrooz, S., Wang, M., Pathak, G.: Analysis and Evaluation of Heuristic Methods for Static Task Scheduling. Jounal of Parallel and Distributed Computing 10, 222–232 (1990)
Gary, M.R., Johnson, D.S.: Computers and Interactability: A guide to the Theory of NP-Completeness. W.H. Freeman and Co (1979)
Hagras, T., Janecek, J.: A High Performance, Low Complexity Algorithm for Compile-Time Task Scheduling in Heterogeneous Systems. Parallel Computing 31(7), 653–670 (2005)
Hsu, C.-H., Weng, M.-Y.: An Improving Critical-Task Anticipation Scheduling Algorithm for Heterogeneous Computing Systems. In: Jesshope, C., Egan, C. (eds.) ACSAC 2006. LNCS, vol. 4186, pp. 97–110. Springer, Heidelberg (2006)
Ilavarasan, E., Thambidurai, P., Mahilmannan, R.: Performance Effective Task Scheduling Algorithm for Heterogeneous Computing System. In: IEEE Proceedings of IPDPS, pp. 28–38 (2005)
Ranaweera, S., Agrawal, D.P.: A Task Duplication Based Scheduling Algorithm for Heterogeneous Systems. In: IEEE Proceedings of IPDPS, pp. 445–450 (2000)
Sakellariou, R., Zhao, H.: A Hybrid Heuristic for DAG Scheduling on Heterogeneous Systems. In: Proc. of the IEEE IPDPS Workshop 1 (2004)
Topcuoglu, H., Hariri, S., Min-You, W.: Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing. IEEE Transactions on PDS 13(3), 260–274 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hsu, CH., Hsieh, CW., Yang, CT. (2007). A Generalized Critical Task Anticipation Technique for DAG Scheduling. In: Jin, H., Rana, O.F., Pan, Y., Prasanna, V.K. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2007. Lecture Notes in Computer Science, vol 4494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72905-1_44
Download citation
DOI: https://doi.org/10.1007/978-3-540-72905-1_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72904-4
Online ISBN: 978-3-540-72905-1
eBook Packages: Computer ScienceComputer Science (R0)