Relaxed Parallel Scheduling Algorithms Investigation of Support Resource Reservation from Grid
2012 ◽
Vol 182-183
◽
pp. 1849-1853
Keyword(s):
In this paper, the grid computing environment resource reservation problem of using the parallel machine, proposed the relaxed time parallel scheduling models and algorithms support resource reservation. The simulation results of FCFS and EASY backfill algorithms in resource utilization, job bounded slowdown factor and the success rate of Advanced Reservation (AR) jobs were studied. Show that the relaxation mechanism, the average waiting time and the average bounded slowdown factor of non-reserved jobs down. EASY backfill algorithm which guarantees AR jobs quality of service at the same time, the better the performance improvement of non-AR jobs.
2014 ◽
Vol 519-520
◽
pp. 108-113
◽
2013 ◽
Vol 427-429
◽
pp. 2519-2522
2017 ◽
Vol 7
(7)
◽
pp. 137
Keyword(s):
2011 ◽
Vol 233-235
◽
pp. 2714-2717
Keyword(s):
2013 ◽
Vol 805-806
◽
pp. 688-692
Keyword(s):