Abstract
In Grid computing, an application will be decomposed into a set of dependent tasks. In the Grid environment where resources have different capability and resources are interconnected over the world, the dependence among tasks affects the scheduling strategy greatly. This paper uses a Task-Resource Assignment Graph (T-RAG) to represent a potential resource assignment plan. And a dependent tasks scheduling model based on Best Task-Resource Assignment Graph (BT-RAG) construction is proposed which maps the dependent tasks scheduling problem into a graph construction problem. The BT-RAG is obtained and such graph is the optimal scheduling plan which determines the resource assignment plan and the execution order of tasks. Finally, the task scheduling algorithm based on the proposed scheduling model is implemented. Compared with HEFT algorithm, the proposed algorithm shows better performance in the situation of a large body of data transported among tasks.
This research is supported by the National Key Technologies Research and Development programming in the 10th Five-year (2004BA721A05) of P.R. China.
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
Foster, I., Kesselman, C.: The Grid: Blueprint for a Future Computing Infrastructure. Morgan Kaufmann, San Francisco (1998)
Vadhiyar, J.D.: A Metascheduler For The Grid. In: Proceedings of the 11th IEEE International Symposium on High PerformanceDistributed Computing, Edinburgh, Scotland, pp. 343–351. IEEE Computer Society, Los Alamitos (2002)
Faycal, B., Jean-Patrick, G., Laurent, L., et al.: Designing and Evaluating an Active Grid Architecture. Future Generation Computer Systems, Advanced Grid Technologies 21(2), 315–330 (2005)
Freund, R.F., Siegel, H.J.: Heterogeneous processing. Computer 26(6), 18–27 (1993)
Topcuoglu, H., Harir, S., Wu, M.-Y.: Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans on Parallel and Distributed Systems 13(1), 260–274 (2002)
Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal 45, 1563–1581 (1966)
Adam, T.L., Chandy, K.M., Dickson, J.R.: A Comparison of List Scheduling for Parallel Processing Systems. Comm. ACM 12(17), 685–690 (1974)
Wu, M.Y., Gajski, D.D.: Hypertool: A Programming Aid for Message-Passing Systems. IEEE Trans. Parallel and Distributed Systems 3(1), 330–343 (1990)
Kruatrachue, B., Lewis, T.: Grain Size Determination for Parallel Processing. IEEE Software, 23–32 (1988)
Macey, B.S., Zomaya, A.Y.: A Performance Evaluation of CP List Scheduling Heuristics for Communication Intensive Task Graphs. In: International Parallel Processing Symposium (IPPS 1998), Orlando, Florida, March 30-April 3 (1998)
Beaumont, O., Boudet, V., Robert, Y.: The Iso-Level Scheduling Heuristic for Heterogeneous Processors. In: PDP 2002, pp. 335–342 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, T., Zhang, B., Hao, X. (2008). A Dependent Tasks Scheduling Model in Grid. In: Zhang, Y., Yu, G., Bertino, E., Xu, G. (eds) Progress in WWW Research and Development. APWeb 2008. Lecture Notes in Computer Science, vol 4976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78849-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-78849-2_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78848-5
Online ISBN: 978-3-540-78849-2
eBook Packages: Computer ScienceComputer Science (R0)