Towards Improving QoS-Guided Scheduling in Grids
4. Rescheduling Optimization
5.3 Experimental Results of ROR
Table 3 analyzes the effectiveness of the ROR technique under different circumstances.
Table 3: Comparison of Resource Used
(a) (NR=100, QR=30%, QT=20%, HT=1, HQ=1)
Task Number (NT) 200 300 400 500 600
QOS Guided Min-Min 100 100 100 100 100
ROR 39.81 44.18 46.97 49.59 51.17
Improved Ratio 60.19% 55.82% 53.03% 50.41% 48.83%
(b) (NT=500, QR=30%, QT=20%, HT=1, HQ=1)
Resource Number (NR) 50 70 90 110 130
QOS Guided Min-Min 50 70 90 110 130
ROR 26.04 35.21 43.65 50.79 58.15
Improved Ratio 47.92% 49.70% 51.50% 53.83% 55.27%
(c) (NT=500, NR=50, QT=20%, HT=1, HQ=1)
QR% 15% 30% 45% 60% 75%
QOS Guided Min-Min 50 50 50 50 50
ROR 14.61 25.94 35.12 40.18 46.5
Improved Ratio 70.78% 48.12% 29.76% 19.64% 7.00%
(d) (NT=500, NR=100, QR=40%, HT=1, HQ=1)
QT% 15% 30% 45% 60% 75%
QOS Guided Min-Min 100 100 100 100 100
ROR 57.74 52.9 48.54 44.71 41.49
Improved Ratio 42.26% 47.10% 51.46% 55.29% 58.51%
(e) (NT=500, NR=100, QR=30%, QT=20%, HQ=1)
HT 1 3 5 7 9
QOS Guided Min-Min 100 100 100 100 100
ROR 47.86 47.51 47.62 47.61 47.28
Improved Ratio 52.14% 52.49% 52.38% 52.39% 52.72%
(f) (NT=500, NR=100, QR=30%, QT=20%, HT=1)
HQ 3 5 7 9 11
QOS Guided Min-Min 100 100 100 100 100
ROR 54.61 52.01 50.64 48.18 46.53
Improved Ratio 45.39% 47.99% 49.36% 51.82% 53.47%
Similar to those of Table 2, Table (a) changes the number of tasks to verify the reduction of resource that needs to be achieved by the ROR technique. We noticed that the ROR has significant improvement in minimizing grid resources. Comparing with the QoS guided Min-Min scheduling algorithm, the ROR achieves 50% ~ 60% improvements without increasing overall makespan of a chunk of grid tasks. Table (b) changes the number of machines. The ROR retains 50% improvement ratio.
Table (c) adjusts percentages of QoS machine. Because this test has 20% QoS tasks, the ROR performs best at 15% QoS machines. This observation implies that the ROR has significant improvement when QoS tasks and QoS machines are with the same percentage. Table (d) sets 40% QoS machine and changes the percentages of QoS tasks. Following the above analysis, the ROR technique achieves more than 50% improvements when QoS tasks are with 45%, 60% and 75%. Tables (e) and (f) change the heterogeneity of tasks. Similar to the results of section 5.2, the heterogeneity of tasks is not critical to the improvement rate of the ROR technique.
Overall speaking, the ROR technique presents 50%
improvements in minimizing total resource need compare with the QoS guided Min-Min scheduling algorithm.
6. Conclusions
In this paper we have presented two optimization schemes aiming to reduce the overall completion time (makespan) of a chunk of grid tasks and minimize the total resource cost. The proposed techniques are based on the QoS guided Min-Min scheduling algorithm. The optimization achieved by this work is twofold; firstly, without increasing resource costs, the overall task execution time could be reduced by the MOR scheme with 7%~15% improvements. Second, without increasing task completion time, the overall resource cost could be reduced by the ROR scheme with 50% reduction on average, which is a significant improvement to the state of the art scheduling technique. The proposed MOR and ROR techniques have characteristics of low complexity, high effectiveness in large-scale grid systems with QoS services.
References
[1] A. Abraham, R. Buyya, and B. Nath, "Nature‟s Heuristics for Scheduling Jobs on Computational Grids", Proc. 8th IEEE International Conference on Advanced Computing and Communications (ADCOM-2000), pp.45-52, 2000.
[2] A. Andrieux, D. Berry, J. Garibaldi, S. Jarvis, J. MacLaren, D.
Ouelhadj, D. Snelling, "Open Issues in Grid Scheduling", National e-Science Centre and the Inter-disciplinary Scheduling Network Technical Paper, UKeS-2004-03.
[3] R. Buyya, D. Abramson, Jonathan Giddy, Heinz Stockinger,
“Economic Models for Resource Management and Scheduling
in Grid Computing”, Journal of Concurrency: Practice and Experience, vol. 14, pp. 13-15, 2002.
[4] Jesper Andersson, Morgan Ericsson, Welf Löwe, and Wolf Zimmermann, "Lookahead Scheduling for Reconfigurable GRID Systems", 10th International Europar'04: Parallel Processing, vol. 3149, pp. 263-270, 2004.
[5] D Yu, Th G Robertazzi, "Divisible Load Scheduling for Grid Computing", 15th IASTED Int‟l. Conference on Parallel and Distributed Computing and Systems, Vol. 1, pp. 1-6, 2003 [6] Fangpeng Dong and Selim G. Akl, "Scheduling Algorithms for
Grid Computing: State of the Art and Open Problems", Technical Report No. 2006-504, 2006.
[7] Ligang He, Stephen A. Jarvis, Daniel P. Spooner, Xinuo Chen, Graham R. Nudd, "Hybrid Performance-oriented Scheduling of Moldable Jobs with QoS Demands in Multiclusters and Grids", Grid and Cooperative Computing (GCC 2004), vol. 3251, pp.
217–224, 2004.
[8] Xiaoshan He, Xian-He Sun, Gregor Von Laszewski, "A QoS Guided Scheduling Algorithm for Grid Computing", Journal of Computer Science and Technology, vol.18, pp.442-451, 2003.
[9] Jang-uk In, Paul Avery, Richard Cavanaugh, Sanjay Ranka,
"Policy Based Scheduling for Simple Quality of Service in Grid Computing", IPDPS 2004, pp. 23, 2004.
[10] J. Schopf. "Ten Actions when Superscheduling: A Grid Scheduling Architecture", Scheduling Architecture Workshop, 7th Global Grid Forum, 2003.
[11] Junsu Kim, Sung Ho Moon, and Dan Keun Sung, "Multi-QoS Scheduling Algorithm for Class Fairness in High Speed Downlink Packet Access", Proceedings of IEEE Personal, Indoor and Mobile Radio Communications Conference (PIMRC 2005), vol. 3, pp. 1813-1817, 2005
[12] M.A. Moges and T.G. Robertazzi, "Grid Scheduling Divisible Loads from Multiple Sources via Linear Programming", 16th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS), pp. 423-428, 2004.
[13] M. Baker, R. Buyya and D. Laforenza, "Grids and Grid Technologies for Wide-area Distributed Computing", in Journal of Software-Practice & Experience, Vol. 32, No.15, pp.
1437-1466, 2002.
[14] Jennifer M. Schopf, "A General Architecture for Scheduling on the Grid", Technical Report ANL/MCS, pp. 1000-1002, 2002.
[15] M. Swany, "Improving Throughput for Grid Applications with Network Logistics", Proc. IEEE/ACM Conference on High Performance Computing and Networking, 2004.
[16] R. Moreno and A.B. Alonso, "Job Scheduling and Resource Management Techniques in Economic Grid Environments", LNCS 2970, pp. 25-32, 2004.
[17] Shah Asaduzzaman and Muthucumaru Maheswaran,
"Heuristics for Scheduling Virtual Machines for Improving QoS in Public Computing Utilities", Proc. 9th International Conference on Computer and Information Technology (ICCIT‟06), 2006.
[18] Gerald Sabin, Rajkumar Kettimuthu, Arun Rajan and P Sadayappan, "Scheduling of Parallel Jobs in a Heterogeneous Multi-Site Environment", in the Proc. of the 9th International Workshop on Job Scheduling Strategies for Parallel Processing, LNCS 2862, pp. 87-104 , June 2003.
[19] Sriram Ramanujam, Mitchell D. Theys, "Adaptive Scheduling based on Quality of Service in Distributed Environments", PDPTA’05, pp. 671-677, 2005.
[20] T. H. Cormen, C. L. Leiserson, and R. L. Rivest, "Introduction to Algorithms", First edition, MIT Press and McGraw-Hill, ISBN 0-262-03141-8, 1990.
[21] Tao Xie and Xiao Qin, "Enhancing Security of Real-Time Applications on Grids through Dynamic Scheduling", Proc. the 11th Workshop on Job Scheduling Strategies for Parallel
Processing (JSSPP'05), pp. 146-158, 2005.
[22] Haobo Yu, Andreas Gerstlauer, Daniel Gajski, "RTOS Scheduling in Transaction Level Models", in Proc. of the 1st IEEE/ACM/IFIP international conference on Hardware/software Codesign & System Synpaper, pp. 31-36, 2003.
[23] Y. Zhu, "A Survey on Grid Scheduling Systems", LNCS 4505, pp. 419-427, 2007.
[24] Weizhe Zhang, Hongli Zhang, Hui He, Mingzeng Hu,
"Multisite Task Scheduling on Distributed Computing Grid", LNCS 3033, pp. 57–64, 2004.
86