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

An Energy-Aware Task Scheduling in the Cloud Computing Using a Hybrid Cultural and Ant Colony Optimization Algorithm

Author

Listed:
  • Poopak Azad

    (Department of Computer Engineering, Tabriz Branch, Islamic Azad University, Tabriz, Iran)

  • Nima Jafari Navimipour

    (Department of Computer Engineering, Tabriz Branch, Islamic Azad University, Tabriz, Iran)

Abstract

In a cloud environment, computing resources are available to users, and they pay only for the used resources. Task scheduling is considered as the most important issue in cloud computing which affects time and energy consumption. Task scheduling algorithms may use different procedures to distribute precedence to subtasks which produce different makespan in a heterogeneous computing system. Also, energy consumption can be different for each resource that is assigned to a task. Many heuristic algorithms have been proposed to solve task scheduling as an NP-hard problem. Most of these studies have been used to minimize the makespan. Both makespan and energy consumption are considered in this paper and a task scheduling method using a combination of cultural and ant colony optimization algorithm is presented in order to optimize these purposes. The basic idea of the proposed method is to use the advantages of both algorithms while avoiding the disadvantages. The experimental results using C# language in cloud azure environment show that the proposed algorithm outperforms previous algorithms in terms of energy consumption and makespan.

Suggested Citation

  • Poopak Azad & Nima Jafari Navimipour, 2017. "An Energy-Aware Task Scheduling in the Cloud Computing Using a Hybrid Cultural and Ant Colony Optimization Algorithm," International Journal of Cloud Applications and Computing (IJCAC), IGI Global, vol. 7(4), pages 20-40, October.
  • Handle: RePEc:igg:jcac00:v:7:y:2017:i:4:p:20-40
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. Abdolrazzagh-Nezhad, Majid, 2020. "Enhanced cultural algorithm to solve multi-objective attribute reduction based on rough set theory," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 170(C), pages 332-350.

    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:7:y:2017:i:4:p:20-40. 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.