Abstract
Efficient scheduling of parallel programs represented by a-cyclic directed graph (DAG), with or without duplication, is one of the most challenging NP-complete problems in parallel and distributed systems. Because of its key importance, this problem has been extensively studied and various heuristics algorithms have been proposed. However, most of the available algorithms are designed under the assumption of unbounded availability of fully connected processors and lie in high complexity range. In this paper, we propose a new task scheduling algorithm, namely, Highly Communicating and Dependant Based Task Scheduling (HCDBTS) algorithm for scheduling DAG structured applications onto interconnection constrained network of heterogeneous processors. Our objective is to develop an efficient scheduling algorithm that will deliver a good schedule i.e., minimize the completion time of the application and still work with limited number of interconnection constrained processors. We compared the performance of HCDBTS algorithm against the Heterogeneous Earliest Finish Time (HEFT) and the Heterogeneous Critical Node First (HCNF) algorithms by simulation. Our extensive simulation studies based on both randomly generated task graphs and the task graphs of some real applications such as Fast Fourier Transformations, Gaussian Elimination, LU Decomposition and Laplace Transformation, reveal that our scheduling algorithm significantly surpass HEFT and HCNF in schedule length and speedup ratio.
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
EI-Rewini, H., Ali, H.H., Lewis, T.G.: Task Scheduling in Multiprocessing Systems. IEEE Trans. Comp., 27–37 (December 1995)
Garey, M.R., Johnson, D.S.: Computers and intractability: A Guide to the Theory of NPCompleteness. W.H. Freeman and Co., New York (1979)
Ahmad, I., Kwok, Y.-K.: On exploiting task duplication in parallel program scheduling. IEEE Trans. Parallel and Distributed Systems 9(9), 872–892 (1998)
Singh, H., Youssef, A.: Mapping and Scheduling Heterogeneous Task Graphs using Genetic Algorithms. In: Proceedings of Heterogeneous Computing Workshop, pp. 86–97 (1996)
Dogan, A., Ozguner, F.: LDBS: A Duplication based scheduling algorithm for heterogeneous computing systems. In: ICPP 2002 (2002)
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)
Darba, S., Agrawal, D.P.: Optimal scheduling algorithm for distributed-memory machines. IEEE Trans. Parallel and Distributed Systems 1(1), 87–94 (1998)
Dhodhi, M.K., Ahmad, I., Yatama, A.: An integrated technique for task matching and scheduling onto Distributed heterogeneous computing systems. Journal of parallel and distributed computing 62, 1338–1361 (2002)
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)
Hwang, J.-J., Chow, Y.C., Anger, F.D., Lee, C.Y.: Scheduling Precedence graphs in systems with interprocessor communication times. SIAM Journal on Computing 18, 224–257 (1989)
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)
Maheswaran, M., Siegel, H.J.: A Dynamic Matching and Scheduling Algorithm for Heterogeneous Computing System. In: Proceedings of Heterogeneous Computing Workshop, pp. 57–69 (1998)
Raduiescu, A., Arjan, J.C.: Low-cost Task Scheduling for Distributed-Memory Machines. IEEE Trans. on Parallel and Distributed Systems 13(6) (June 2002)
Topcuoglu, H., Hariri, S., Wu, M.-Y.: Task scheduling algorithms for heterogeneous computing processors. In: IPPS/SPDP Workshop on Heterogeneous computing, San Juan, Puerto Rico, April 1999, pp. 3–14 (1999)
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) (March 2002)
Liou, J., Palis, M.A.: An Efficient Clustering Heuristics for Scheduling DAGs on Multiprocessors. In: Int.l. conf. on Parallel and Distributed Processing (1996)
Radulescu, A., Van Gemund, A.J.C.: Fast and Effective Task Scheduling in Heterogeneous Systems. In: Proceedings of Heterogeneous Computing, May 2000, pp. 229–238 (2000)
Ranaweera, A., Agrawal, D.P.: A Task Duplication based Algorithm for heterogeneous Systems. In: Int.l. Conference on Parallel and Distributed Processing, May 1-5, pp. 445–450 (2000)
Basker, S., Ranga, P.C.S.: Scheduling Directed A-cyclic task graphs on heterogeneous Network of Workstations to minimize Schedule length. In: Int. l.’ Conference on Parallel Processing (2003)
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
Ilavarasan, E., Thambidurai, P., Punithavathi, N. (2004). Task Scheduling Algorithm for Interconnection Constrained Network of Heterogeneous Processors. In: Das, G., Gulati, V.P. (eds) Intelligent Information Technology. CIT 2004. Lecture Notes in Computer Science, vol 3356. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30561-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-30561-3_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24126-3
Online ISBN: 978-3-540-30561-3
eBook Packages: Computer ScienceComputer Science (R0)