Selective preemption strategies for parallel job scheduling
International Journal of High Performance Computing and Networking
Optimal load distribution in nondedicated heterogeneous cluster and grid computing environments
Journal of Systems Architecture: the EUROMICRO Journal
A comparison between two grid scheduling philosophies: EGEE WMS and Grid Way
Multiagent and Grid Systems - Grid Computing, high performance and distributed applications
Combining batch execution and leasing using virtual machines
HPDC '08 Proceedings of the 17th international symposium on High performance distributed computing
Experimental study of virtual machine migration in support of reservation of cluster resources
VTDC '07 Proceedings of the 2nd international workshop on Virtualization technology in distributed computing
The Power of Preemption in Economic Online Markets
GECON '08 Proceedings of the 5th international workshop on Grid Economics and Business Models
HiPC'08 Proceedings of the 15th international conference on High performance computing
Service control with the preemptive parallel job scheduler Scojo-PECT
Cluster Computing
Workload characteristics of a multi-cluster supercomputer
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
Resource provisioning based on lease preemption in InterGrid
ACSC '11 Proceedings of the Thirty-Fourth Australasian Computer Science Conference - Volume 113
Hi-index | 0.00 |
In multi-cluster Grids each cluster serves requests from external (Grid) users along with their own local users. The problem arises when there is not sufficient resources for local users (which have high priority) to be served urgently. This problem could be solved by preempting resources from Grid users and allocating them to the local users. However, resource preemption entails decreasing resource utilization and increasing Grid users' response time. The question is that how we can minimize the number of preemptions taking place in a resource sharing environment. In this paper, we propose a preemption-aware scheduling policy based on the queuing theory for a virtualized multi-cluster Grid where the number of preemptions is minimized. Simulation results indicate that the proposed scheduling policy significantly decreases the number of virtual machine (VM) preemptions (up to 22.5%).