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

Virtual Machine Allocation in Cloud Computing Environment

Author

Listed:
  • Absalom E. Ezugwu

    (Department of Computer Science, Faculty of Science, Federal University Lafia, Lafia, Nasarawa State, Nigeria)

  • Seyed M. Buhari

    (Department of Computer Science, Faculty of Science, Universiti Brunei Darussalam, Gadong, Brunei)

  • Sahalu B. Junaidu

    (Department of Mathematics, Faculty of Science, Ahmadu Bello University, Zaria, Kaduna State, Nigeria)

Abstract

Virtual machine allocation problem is one of the challenges in cloud computing environments, especially for the private cloud design. In this environment, each virtual machine is mapped unto the physical host in accordance with the available resource on the host machine. Specifically, quantifying the performance of scheduling and allocation policy on a Cloud infrastructure for different application and service models under varying performance metrics and system requirement is an extremely challenging and difficult problem to resolve. In this paper, the authors present a Virtual Computing Laboratory framework model using the concept of private cloud by extending the open source IaaS solution Eucalyptus. A rule based mapping algorithm for Virtual Machines (VMs) which is formulated based on the principles of set theoretic is also presented. The algorithmic design is projected towards being able to automatically adapt the mapping between VMs and physical hosts’ resources. The paper, similarly presents a theoretical study and derivations of some performance evaluation metrics for the chosen mapping policies, these includes determining the context switching, waiting time, turnaround time, and response time for the proposed mapping algorithm.

Suggested Citation

  • Absalom E. Ezugwu & Seyed M. Buhari & Sahalu B. Junaidu, 2013. "Virtual Machine Allocation in Cloud Computing Environment," International Journal of Cloud Applications and Computing (IJCAC), IGI Global, vol. 3(2), pages 47-60, April.
  • Handle: RePEc:igg:jcac00:v:3:y:2013:i:2:p:47-60
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hajara Idris & Absalom E Ezugwu & Sahalu B Junaidu & Aderemi O Adewumi, 2017. "An improved ant colony optimization algorithm with fault tolerance for job scheduling in grid computing systems," PLOS ONE, Public Library of Science, vol. 12(5), pages 1-24, May.

    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:3:y:2013:i:2:p:47-60. 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.