IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v9y2018i1p49-59.html
   My bibliography  Save this article

Efficient Job Scheduling in Computational Grid Systems Using Wind Driven Optimization Technique

Author

Listed:
  • Tarun Kumar Ghosh

    (Department of Computer Science & Engineering, Haldia Institute of Technology, West Bengal, India)

  • Sanjoy Das

    (Department of Engineering & Technological Studies, Kalyani University, West Bengal, India)

Abstract

Computational Grid has been employed for solving complex and large computation-intensive problems with the help of geographically distributed, heterogeneous and dynamic resources. Job scheduling is a vital and challenging function of a computational Grid system. Job scheduler has to deal with many heterogeneous computational resources and to take decisions concerning the dynamic, efficient and effective execution of jobs. Optimization of the Grid performance is directly related with the efficiency of scheduling algorithm. To evaluate the efficiency of a scheduling algorithm, different parameters can be used, the most important of which are makespan and flowtime. In this paper, a very recent evolutionary heuristic algorithm known as Wind Driven Optimization (WDO) is used for efficiently allocating jobs to resources in a computational Grid system so that makespan and flowtime are minimized. In order to measure the efficacy of WDO, Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are considered for comparison. This study proves that WDO produces best results.

Suggested Citation

  • Tarun Kumar Ghosh & Sanjoy Das, 2018. "Efficient Job Scheduling in Computational Grid Systems Using Wind Driven Optimization Technique," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 9(1), pages 49-59, January.
    • Handle: RePEc:igg:jamc00:v:9:y:2018:i:1:p:49-59
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2018010104
    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:jamc00:v:9:y:2018:i:1:p:49-59. 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.