Performance analysis of preemption-aware scheduling in multi-cluster grid environments

3Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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%). © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Salehi, M. A., Javadi, B., & Buyya, R. (2011). Performance analysis of preemption-aware scheduling in multi-cluster grid environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7016 LNCS, pp. 419–432). https://doi.org/10.1007/978-3-642-24650-0_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free