A Novel Reliability-Driven Heuristic for Grid Task Scheduling

Abstract:

Under dynamic, unreliable grid environment, a novel heuristic based on average reliability of task is proposed, which task into account the failure condition and dynamic workload of Grid. On the basis of the heuristic strategy proposed, this paper improved two classic scheduling algorithms, Min-min and Sufferage, to improve execution reliability of grid task. Moreover, a new greedy algorithm, GR, is proposed in the paper. The simulation experimental results indicate that the algorithms based on the average reliability heuristic are better than Min-min and Sufferage in terms of task completion ratio by 10%, which can guarantee the user's deadline efficiently.

• Periodical: Applied Mechanics and Materials (Volumes 291-294)
• Pages: 2895-2898
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.291-294.2895
• Online since: February 2013
• Authors: Lin Wu, Cai Li Fang, Cao Kun Yan
• Keywords: Greedy Algorithm, Grid Computing, GridSim, Reliability, Task Scheduling

References

[1] D. Fernández-Baca, Allocating modules to processors in a distributed system, IEEE Transactions on Software Engineering, pp.1427-1436, November (1989).

DOI: 10.1109/32.41334

[2] Y.S. Dai, M. Xie, K.L. Poh, Reliability of Grid Service Systems, Computers and Industrial Engineering, vol. 50 (1-2), 2006, pp.130-147.

DOI: 10.1016/j.cie.2005.12.004

[3] Kobra Etminani, M. Naghibzadeh. A Min-Min Max-Min Selective Algorihtm for Grid Task Scheduling. ICI 2007. 3rd IEEE/IFIP International Conference in Central Asia, Sept. (2007).

DOI: 10.1109/canet.2007.4401694

[4] He XS, Sun XH, von Laszewski G, QoS guided min-min heuristic for grid task scheduling, Journal of Computer Science and Technology, vol. 18, pp.442-451, (2003).

DOI: 10.1007/bf02948918

[5] C Weng , X Lu, Heuristic scheduling for bag-of-tasks applications in combination with QoS in the computational grid, Future Generation Computer Systems, vol. 21, pp.271-280, (2005).

DOI: 10.1016/j.future.2003.10.004