Abstract
This paper addresses the problem of scheduling a parallel program represented by a directed acyclic task graph onto homogeneous cluster systems to minimize its execution time. Many sub-optimal algorithms have been proposed that promises acceptable running time but not optimal solutions. We propose an algorithm that guarantees optimal solutions but not acceptable running time. Experiments show that in many practical cases the proposed algorithm performs very effectively in comparison with sub-optimal algorithms while still getting the optimal solutions.
This paper is supported by the Shanghai Science and Technology Development Foundation under Grant No. 03DZ15027 and the National Natural Science Foundation of China under Grant No. 60173033
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
Ahmad, Kwok, Y.K., Wu, M.Y., Shu, W.: CASCH: a tool for computer-aided scheduling. IEEE Concurrency, 21–33 (October-December 2000)
Kruatrachue, B., Lewis, T.: Grain size determination for parallel processing. IEEE Software, 23–32 (January 1988)
Ullman, J.D.: NP-complete scheduling problems. Journal of Computing System Science 10, 384–393 (1975)
Darbha, S., Agrawal, D.P.: A task duplication based scalable scheduling algorithm for distributed memory system. Journal of Parallel Distributed Computing 46, 15–26 (1997)
Kwok, Y.K., Ahmad, I.: Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors. ACM Computing Surveys 31(4), 407–471 (1999)
Kruatrachue, Lewis, T.: Grain size determination for parallel processing. IEEE Software, 23–32 (January 1988)
Park, C.I., Choe, T.Y.: An optimal scheduling algorithm based on task duplication. IEEE Trans. Computers 51(4), 444–448 (2002)
Ranaweera, S., Agrawal, D.P.: A Task Duplication Based Scheduling Algorithm for Heterogeneous Systems. In: Proceedings of 4th International Parallel and Distributed Processing Symposium, pp. 445–450 (2000)
Kwok, Y.-K., Ahmad, I.: Benchmarking the task graph scheduling algorithms. In: Proc. 1st Merged IPPS/SPDP, March 1998, pp. 531–537 (1998)
Task Graph Scheduling Benchmarks, http://www.eee.hku.hk/~kwok/data/benchmarks.tar.gz
Chen, G.–H., Yu, J.-S.: A Branch-And-Bound-With Underestimates Algorithm for the Task Assignment Problem with Precedence Constraint. In: Proc. Int’l Conf. Distributed Computing Systems, pp. 494–501 (1990)
Karp, R.M., Zhang, Y.: Randomized Parallel Algorithms for Backtrack Search and Branch-and-Bound Computation. Jorunal of the ACM 40(3), 765–789 (1993)
Palis, M.A., Liou, J.-C., Wei, D.S.L.: Task clustering and scheduling for distributed memory parallel architectures. IEEE Transactions on Parallel and Distributed Systems 7(1), 46–55 (1996)
Ahmad, I., Kwok, Y.K.: Optimal and Near-Optimal Allocation of Precedence- Constrained Tasks to Parallel Processors: Defying the High Complexity Using Effective Search Techniques. In: Proceedings of International Conference on Parallel Processing, Minneapolis, Minnesota, U.S.A., August 1998, pp. 424–431 (1998)
Ahmad, I., Kwok, Y.-K.: On Exploiting Task Duplication in Parallel Program Scheduling. IEEE Transactions on Parallel and Distributed Systems 9(9), 872–892 (1998)
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
Xie, X., Yao, W., You, J. (2004). An Optimal Task Scheduling for Cluster Systems Using Task Duplication. 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_136
Download citation
DOI: https://doi.org/10.1007/978-3-540-24680-0_136
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21993-4
Online ISBN: 978-3-540-24680-0
eBook Packages: Springer Book Archive