Optimum allocation of distributed service workflows with probabilistic real-time guarantees
Service Oriented Computing and Applications
| Hi-index | 0.00 |
Advance Reservations are important to guarantee the Quality of Services of Grid Jobs. However, the influence of AR from the Grid on local parallel schedulers is not clearly known. EASY backfill and Conservative backfill are two important parallel scheduling algorithms. This paper examined their procedures to support AR, evaluated their performances impacted from AR by using discrete event simulations with real trace from the parallel workload archive. Results show that as AR request increases, EASY backfill is preferable with higher utilization and lower average expansion factor and average weighted response time for both of local and AR Grid jobs. The use of conservative backfill typically provides both of local jobs and AR Grid jobs improved predictability and certainty, at the cost of lower utilization and degraded performance for both of local and AR Grid jobs.