Abstract
This paper analyses the Min-min algorithm and its improved algorithms through the performances of load balance, time span, quality of service and economic principle. Based on the analysis of the merits of these algorithms, we propose an improved algorithm as PMTS (Priority-based maximum time-span algorithm) by integrating. In the instance of the application, we analyse and compare the performances of these algorithms, and experimental results show that, PMTS algorithm is better than other algorithms in the comprehensive performance of load-balance, time-span, quality of service and other aspects.
Publisher
Trans Tech Publications, Ltd.
Reference8 articles.
1. Yubao Cui, Zhenhua Jia, Zhiguo Hou and Guixiang Xue: Research on Algorithms for Tasks Scheduling on Grid Computing. Control & Automation vol. 22, NO. 5, 2006, pp.109-111.
2. Chuang Guo, Liang Yu: Research on algorithm for tasks scheduling in grid. Computer Technology and Development vol. 19, No. 6, 2009, pp.5-8, 12.
3. Wushou Sliamu, Yong Hou and Junwei Cao: Enhanced Adaptive Scheduling for the Grid Harvest Service. In: WRI World Congress on Software Engineering, 2009, pp.35-39.
4. Hanyang Jiang, Ying Wang: Research of Min-Min Algorithm and Improved Algorithm in Grid Computing. Computer Era vol. 1, 2010, pp.39-41.
5. Etminani, K., Naghibzadeh, M.: A Min-Min Max-Min selective algorihtm for grid task scheduling. In: The 3rd IEEE/IFIP International Conference in Central Asia on Internet, 2007, P. 1 - 7.