Abstract
The task scheduling problem in heterogeneous system is known as NP-hard. Recently, Bajaj and Agrawal proposed an algorithm TANH (Task duplication-based scheduling Algorithm for Network of Heterogeneous systems) with optimality conditions, which are wider than previous optimality conditions. TANH algorithm combines the clustering technique with task duplication. We propose two postprocessing algorithms, HPSA1 (Heterogeneous Posterior Scheduling Algorithm) and HPSA2, to reduce the schedule length for DAGs which don’t satisfy the optimality conditions of TANH algorithm. Our algorithms reduce the schedule length by exchanging task clusters in which its parent tasks reside. We compare with HCNF (Heterogeneous Critical Node First) algorithm by illustrating an example to show how our algorithms operate.
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
Ullman, J.D.: NP-complete scheduling problems. Journal of Computing System Science 10, 384–393 (1975)
Liou, J., Palis, M.: A Comparison of General Approaches to Multiprocessor Scheduling. In: Proc. Int’l Parallel Processing Symp., pp. 152–156 (1997)
Kwok, Y., Ahmed, I.: Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors. IEEE Trans. Parallel and Distributed Systems 7(5), 506–521 (1996)
Sih, G.C., Lee, E.A.: A Compile-Time Scheduling Heuristic for Interconnection- Constrained Heterogeneous Processor Architectures. IEEE Trans. Parallel and Distributed Systems 4(2), 175–186 (1993)
Radulescu, A., Van Gemund, A.J.C.: Fast and Effective Task Scheduling in Heterogeneous Systems. In: Proc. of HCW, May 2000, pp. 229–238 (2000)
Ahmad, I., Kwok, Y.: On exploiting Task Duplication in Parallel Program Scheduling. IEEE Trans. Parallel and Distributed Systems 9(9), 872–892 (1998)
Yang, T., Gerasoulis, A.: DSC: Scheduling Parallel Tasks on an Unbounded Number of processors. IEEE Trans. Parallel and Distributed Systems 5(9), 951–967 (1994)
Kim, S.J., Browne, J.C.: A General Approach to Mapping of Parallel Computation upon Multiprocessor Architecture. In: Proc. Int’l Conf. Parallel Proc., vol. 2, pp. 23–32 (1988)
Liou, J., Palis, M.A.: An Efficient Clustering Heuristics for Scheduling DAGs on Multiprocessors. In: Proc. of Parallel and Distributed processing symposium (1996)
Dogan, A., Ozguner, F.: LDBS: A Duplication Based Scheduling Algorithm for Heterogeneous Computing Systems. In: Proc. of Int’l Parallel Processing (ICPP’02) (2002)
Darba, S., Agrawal, D.P.: Optimal Scheduling Algorithm for Distributed-Memory Machines. IEEE Trans. Parallel and Distributed Systems 9(1), 87–94 (1998)
Park, G.-L., Shirazi, B., Marguis, J.: DFRN: A New Approach for Duplication Based Scheduling for distributed memory multiprocessor systems. In: Proc. Of Int’l Parallel Processing Symposium, Geneva, Switzerland (Apr. 1997)
Bajaj, R., Agrawal, D.P.: Improving Scheduling of Tasks in a Heterogeneous Environment. IEEE Trans. Parallel and Distributed Systems 15(2) (2004)
Hou, E.S.H., Ansari, N., Ren, H.: A Genetic Algorithm for Multiprocessor Scheduling. IEEE Trans. Parallel and Distributed Systems 5(2), 113–120 (1994)
Singh, H., Youssef, A.: Mapping and Scheduling Heterogeneous TaskGraphs using Genetic Algorithms. In: Proc. of Heterogeneous Computing Workshop, pp. 86–97 (1996)
Ranaweera, A., Agrawal, D.P.: A Task Duplication based Algorithm for Heterogeneous Systems. In: Proc. of IPDPS, May 1-5, 2000, pp. 445–450 (2000)
Topcuoglu, H., Hariri, S., Wu, M.-Y.: Performance-Effective and Low-complexity Task Scheduling for heterogeneous computing. IEEE Trans. on Parallel and Distributed Systems 13(3) (2002)
Ilavarasan, E., Thambidurai, P.: Levelized Scheduling of Directed A-cyclic Precedence Constrained Task Graphs onto Heterogeneous Computing System. In: Proceedings of the First International Conference on Distributed Frameworks for Multimedia Applications (DFMA’05) (2005)
Baskiyar, S., SaiRanga, P.C.: Scheduling Directed A-cyclic Task Graphs on Heterogeneous Network of Workstations to Minimize Schedule length. In: Proceeding of the 2003 International Conference on Parallel Processing Workshops (ICPPW’03) (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Shen, L., Choe, TY. (2007). Posterior Task Scheduling Algorithms for Heterogeneous Computing Systems. In: Daydé, M., Palma, J.M.L.M., Coutinho, Á.L.G.A., Pacitti, E., Lopes, J.C. (eds) High Performance Computing for Computational Science - VECPAR 2006. VECPAR 2006. Lecture Notes in Computer Science, vol 4395. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71351-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-71351-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71350-0
Online ISBN: 978-3-540-71351-7
eBook Packages: Computer ScienceComputer Science (R0)