Share This Article:

An Improved Task Scheduling Algorithm in Grid Computing Environment

Abstract Full-Text HTML Download Download as PDF (Size:227KB) PP. 227-231
DOI: 10.4236/ijcns.2011.44027    5,535 Downloads   11,297 Views   Citations

ABSTRACT

Algorithm research of task scheduling is one of the key techniques in grid computing. This paper firstly describes a DAG task scheduling model used in grid computing environment, secondly discusses generational scheduling (GS) and communication inclusion generational scheduling (CIGS) algorithms. Finally, an improved CIGS algorithm is proposed to use in grid computing environment, and it has been proved effectively.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

L. Yu, G. Zhou and Y. Pu, "An Improved Task Scheduling Algorithm in Grid Computing Environment," International Journal of Communications, Network and System Sciences, Vol. 4 No. 4, 2011, pp. 227-231. doi: 10.4236/ijcns.2011.44027.

References

[1] M. Shang, S. Sun, et al., “An Efficient Parallel Scheduling Algorithm of Dependent Task Graphs,” Proceedings of the 4th International Conference on Parallel and Distributed Computing, Applications and Technologies, Chengdu, 27-29 August 2003, pp. 595-598. doi:10.1109/PDCAT.2003.1236372
[2] M. Wu, W. Shu, et al., “Efficient Local Search for DAG Scheduling,” IEEE Transactions on Parallel and Distributed Systems, Vol. 12, No. 6, 2001, pp. 617-627.
[3] R. S. Oliveira and J. S. Fraga, “Fixed Priority Scheduling of Tasks with Arbitrary Precedence Constraints in Distributed Hard Real-Time Systems,” Journal of Systems Architecture, Vol. 46, No. 9, 2000, pp. 991-1004.
[4] B. R. Carter, D. W. Watson, et al., “Generational Scheduling for Dynamic Task Management in Heterogeneous Computing Systems,” Journal of Information Sciences, Vol. 106, No. 1, 1998, pp. 219-236.

  
comments powered by Disqus

Copyright © 2019 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.