IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v30y2015i3d10.1007_s10878-013-9644-6.html
   My bibliography  Save this article

An efficient meta-heuristic algorithm for grid computing

Author

Listed:
  • Zahra Pooranian

    (Dezful Islamic Azad University)

  • Mohammad Shojafar

    (Sapienza University of Rome)

  • Jemal H. Abawajy

    (Deakin University)

  • Ajith Abraham

    (Scientific Network for Innovation and Research Excellence)

Abstract

A grid computing system consists of a group of programs and resources that are spread across machines in the grid. A grid system has a dynamic environment and decentralized distributed resources, so it is important to provide efficient scheduling for applications. Task scheduling is an NP-hard problem and deterministic algorithms are inadequate and heuristic algorithms such as particle swarm optimization (PSO) are needed to solve the problem. PSO is a simple parallel algorithm that can be applied in different ways to resolve optimization problems. PSO searches the problem space globally and needs to be combined with other methods to search locally as well. In this paper, we propose a hybrid-scheduling algorithm to solve the independent task-scheduling problem in grid computing. We have combined PSO with the gravitational emulation local search (GELS) algorithm to form a new method, PSO–GELS. Our experimental results demonstrate the effectiveness of PSO–GELS compared to other algorithms.

Suggested Citation

  • Zahra Pooranian & Mohammad Shojafar & Jemal H. Abawajy & Ajith Abraham, 2015. "An efficient meta-heuristic algorithm for grid computing," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 413-434, October.
    • Handle: RePEc:spr:jcomop:v:30:y:2015:i:3:d:10.1007_s10878-013-9644-6
    DOI: 10.1007/s10878-013-9644-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-013-9644-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-013-9644-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    References listed on IDEAS

    as
    1. J.E. Orosz & S.H. Jacobson, 2002. "Analysis of Static Simulated Annealing Algorithms," Journal of Optimization Theory and Applications, Springer, vol. 115(1), pages 165-182, October.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Adinarayanan Arunagiri & Uthayakumar Marimuthu & Prabhakaran Gopalakrishnan & Adam Slota & Jerzy Zajac & Maheandera Prabu Paulraj, 2017. "Sustainability Formation of Machine Cells in Group Technology Systems Using Modified Artificial Bee Colony Algorithm," Sustainability, MDPI, vol. 10(1), pages 1-21, December.
    2. Xin Zhang & Dexuan Zou & Xin Shen, 2018. "A Novel Simple Particle Swarm Optimization Algorithm for Global Optimization," Mathematics, MDPI, vol. 6(12), pages 1-34, November.
    3. Xin Yang & Zhenxiang Zeng & Ruidong Wang & Xueshan Sun, 2016. "Bi-Objective Flexible Job-Shop Scheduling Problem Considering Energy Consumption under Stochastic Processing Times," PLOS ONE, Public Library of Science, vol. 11(12), pages 1-13, December.
    4. Mohit Agarwal & Gur Mauj Saran Srivastava, 2018. "Genetic Algorithm-Enabled Particle Swarm Optimization (PSOGA)-Based Task Scheduling in Cloud Computing Environment," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 17(04), pages 1237-1267, July.
    5. Wanting Zhang & Ming Zeng & Peng Guo & Kun Wen, 2022. "Variable Neighborhood Search for Multi-Cycle Medical Waste Recycling Vehicle Routing Problem with Time Windows," IJERPH, MDPI, vol. 19(19), pages 1-25, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Marc Robini & Pierre-Jean Reissman, 2013. "From simulated annealing to stochastic continuation: a new trend in combinatorial optimization," Journal of Global Optimization, Springer, vol. 56(1), pages 185-215, May.
    2. Sheldon H. Jacobson & Shane N. Hall & Laura A. McLay & Jeffrey E. Orosz, 2005. "Performance Analysis of Cyclical Simulated Annealing Algorithms," Methodology and Computing in Applied Probability, Springer, vol. 7(2), pages 183-201, June.
    3. Alexander Nikolaev & Sheldon Jacobson & Shane Hall & Darrall Henderson, 2011. "A framework for analyzing sub-optimal performance of local search algorithms," Computational Optimization and Applications, Springer, vol. 49(3), pages 407-433, July.
    4. Franzin, Alberto & Stützle, Thomas, 2023. "A landscape-based analysis of fixed temperature and simulated annealing," European Journal of Operational Research, Elsevier, vol. 304(2), pages 395-410.
    5. Luis Rios & Nikolaos Sahinidis, 2013. "Derivative-free optimization: a review of algorithms and comparison of software implementations," Journal of Global Optimization, Springer, vol. 56(3), pages 1247-1293, July.

    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:spr:jcomop:v:30:y:2015:i:3:d:10.1007_s10878-013-9644-6. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.