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

Mohsen Amini Salehi, Bahman Javadi, Rajkumar Buyya

    Research output: Chapter in Book / Conference PaperConference Paperpeer-review

    3 Citations (Scopus)

    Abstract

    ![CDATA[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%).]]
    Original languageEnglish
    Title of host publicationAlgorithms and Architectures for Parallel Processing: Proceedins of the 11th International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP 2011), Melbourne, Australia, 24 - 26 October, 2011
    PublisherSpringer
    Pages419-432
    Number of pages14
    ISBN (Print)9783642246494
    DOIs
    Publication statusPublished - 2011
    EventInternational Conference on Algorithms and Architectures for Parallel Processing -
    Duration: 24 Oct 2011 → …

    Conference

    ConferenceInternational Conference on Algorithms and Architectures for Parallel Processing
    Period24/10/11 → …

    Fingerprint

    Dive into the research topics of 'Performance analysis of preemption-aware scheduling in multi-cluster grid environments'. Together they form a unique fingerprint.

    Cite this