Abstract
Effective task scheduling is crucial for achieving good performance in high performance computing. Many scheduling algorithms have been devised for heterogeneous computing and CPOP is one of the scheduling algorithms. In this paper we present new scheduling algorithms, CPOC and CPOC_E by modifying the CPOP. We use a cluster of processors for critical-path tasks while a single processor is used in the CPOP. This heuristic is useful for realistic Grid computing environments in which communication costs are not arbitrarily heterogeneous. In an additional heuristic the critical-path tasks are considered to finish (or start) as early as possible when non critical-path tasks are scheduled. For performance study we developed a task graph generator and a tool which would support more realistic network configuration. The experimental results show our scheduling algorithm outperforms the CPOP as well as the HEFT.
This work was supported by Konkuk University (2003).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Foster, I., Kesselman, C. (eds.): The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1999)
Foster, I., Kesselman, C., Tuecke, S.: The Anatomy of the Grid: Enabling Scalable Virtual Organizations. In: Proc. of 1st International Symposium on Cluster Computing and the Grid, CCGRID 2001 (2001)
Berman, F., Fox, G.C., Hey, A.J.G.: Grid Computing: Making the Global Infrastructure a Reality. John Wiley & Sons, Chichester (2003)
Boeres, C., Lima, A.: Hybrid Task Scheduling: Integrating Static and Dynamic Heuristics. In: Proc. of the 15th Symposium on Computer Architecture and High Performance Computing, SBAC-PAD 2003 (2003)
Chen, H., Maheswaran, M.: Distributed Dynamic Scheduling of Composite Tasks on Grid Computing Systems. In: Proc. of the International Parallel and Distributed Processing Symposium, IPDPS 2002 (2002)
Fujimoto, N., Hagihara, K.: Near-Optimal Dynamic Task Scheduling of Precedence Constrained Coarse-Grained Tasks onto a Computational Grid. In: Proc. of the 2nd International Symposium on Parallel and Distributed Computing, ISPDC 2003 (2003)
El-Rewini, H., Ali, H.H.: Task Scheduling in Multiprocessing Systems. IEEE Computer, 27–37 (December 1995)
Kwok, Y., Ahmad, I.: Static Scheduling Algorithms for Allocating Directed Task Graphs. ACM Computing Surveys 31(4), 407–471 (1999)
Casavant, T.L., Kuhl, J.G.: A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems. IEEE Trans. on Software Engineering 14(2), 141–154 (1988)
Topcuoglu, H., Hariri, S., Wu, M.: Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing. IEEE Trans. on Parallel and Distributed Systems 13(3), 260–274 (2002)
Ahmad, I., Kwok, Y.: On Exploiting Task Duplication in Parallel Program Scheduling. IEEE Trans. on Parallel and Distributed Systems 9(9), 872–892 (1998)
Wu, M., Gajski, D.D.: Hypertool: A Programming Aid for Message-passing Systems. IEEE Trans. on Parallel and Distributed Systems 1(3), 330–343 (1990)
Yang, T., Gerasoulis, A.: DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors. IEEE Trans. on Parallel and Distributed Systems 5(9), 951–967 (1994)
Kwok, Y., Ahmad, I.: Dynamic Critical-path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessor. IEEE Trans. on Parallel and Distributed Systems 7(5), 506–521 (1996)
Hwang, J., Chow, Y., Anger, F.D., Lee, C.: Scheduling Precedence Graphs in Systems with Interprocessor Communication Times. SIAM J. Comput. 18(2), 244–257 (1989)
Sih, G.C., Lee, E.A.: A Compile-time Scheduling Heuristic for Interconnection-constrained Heterogeneous Processor Architectures. IEEE Trans. on Parallel and Distributed Systems 4(2), 75–87 (1993)
El-Rewini, H., Ali, H.H.: Scheduling Parallel Program Tasks onto Arbitrary Target Machines. Journal of Parallel and Distributed Computing 9(2), 138–153 (1990)
Doar, M.B.: A Better Model for Generating Test Networks. IEEE Global Telecommunications Conference (November 1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, J., Rho, J., Lee, JO., Ko, MC. (2005). CPOC: Effective Static Task Scheduling for Grid Computing. In: Yang, L.T., Rana, O.F., Di Martino, B., Dongarra, J. (eds) High Performance Computing and Communications. HPCC 2005. Lecture Notes in Computer Science, vol 3726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11557654_56
Download citation
DOI: https://doi.org/10.1007/11557654_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29031-5
Online ISBN: 978-3-540-32079-1
eBook Packages: Computer ScienceComputer Science (R0)