IDEAS home Printed from https://ideas.repec.org/a/ids/ijscom/v1y2014i3p211-236.html
   My bibliography  Save this article

Parallel plants collaborative growth algorithm for virtual machine migration

Author

Listed:
  • Fei Wang
  • Anting Chen
  • Yuanjun Laili
  • Lin Zhang
  • Peng Wan
  • Dongming Zhao
  • Fei Tao

Abstract

With the development of cloud computing, more and more virtual computing resources are provided as dynamic services to achieve green and agile computing for different kinds of projects. Virtual machine migration, as one of the main technologies, has brought huge influences on the executive and collaborative efficiency of virtual machines. However, the existing research focuses primarily on management and scheduling of virtual machines. And several studies concerning virtual machine migration in service-oriented computing still have great limitations. Especially, with the expansion of the scale of collaborative computing tasks, the complexity, as well as the number of virtual machines increased significantly. When the pre-allocation of virtual machines becomes unsuitable due to some resource failures or long waiting queue, migration of virtual machine becomes imperative. Considering the influence of initial allocation, this paper proposes a new parallel plant collaborative growth algorithm (namely Parallel-PCGA) which combines efficient plant growth optimisation operator and ring topology-based parallelisation. It brings an effective balance in solution time and accuracy. Experimental results prove that Parallel-PCGA shows high performance in large-scale virtual machine migration in cloud computing.

Suggested Citation

  • Fei Wang & Anting Chen & Yuanjun Laili & Lin Zhang & Peng Wan & Dongming Zhao & Fei Tao, 2014. "Parallel plants collaborative growth algorithm for virtual machine migration," International Journal of Service and Computing Oriented Manufacturing, Inderscience Enterprises Ltd, vol. 1(3), pages 211-236.
  • Handle: RePEc:ids:ijscom:v:1:y:2014:i:3:p:211-236
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=63994
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijscom:v:1:y:2014:i:3:p:211-236. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=376 .

    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.