IDEAS home Printed from https://ideas.repec.org/a/igg/jcac00/v2y2012i1p41-52.html
   My bibliography  Save this article

A Heuristic Meta Scheduler for Optimal Resource Utilization and Improved QoS in Cloud Computing Environment

Author

Listed:
  • R. Jeyarani

    (Coimbatore Institute of Technology, India)

  • N. Nagaveni

    (Coimbatore Institute of Technology, India)

Abstract

This paper presents a novel Meta scheduler algorithm using Particle Swarm Optimization (PSO) for cloud computing environment that focuses on fulfilling deadline requirements of the resource consumers as well as energy conservation requirement of the resource provider contributing towards green IT. PSO is a population-based heuristic method which can be used to solve NP-hard problems. The nature of jobs is considered to be independent, non pre-emptive, parallel and time critical. In order to execute jobs in a cloud, primarily Virtual Machine (VM) instances are launched in appropriate physical servers available in a data-center. The number of VM instances to be created across different servers to complete the time critical jobs successfully, is identified using PSO by exploiting the idle resources in powered-on servers. The scheduler postpones the power-up/activation of new servers/hosts for launching enqueued VM requests, as long as it is possible to meet the deadline requirements of the user. The Meta Scheduler also incorporates Backfilling Strategy which improves makespan. The results conclude that the proposed novel Meta scheduler gives optimization in terms of number of jobs meeting their deadlines (QoS) and utilization of computing resources, helping both cloud service consumer as well as cloud service provider.

Suggested Citation

  • R. Jeyarani & N. Nagaveni, 2012. "A Heuristic Meta Scheduler for Optimal Resource Utilization and Improved QoS in Cloud Computing Environment," International Journal of Cloud Applications and Computing (IJCAC), IGI Global, vol. 2(1), pages 41-52, January.
    • Handle: RePEc:igg:jcac00:v:2:y:2012:i:1:p:41-52
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijcac.2012010103
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jcac00:v:2:y:2012:i:1:p:41-52. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.