IDEAS home Printed from https://ideas.repec.org/a/apa/ijapss/2015p42-50.html
   My bibliography  Save this article

Range-Suffrage Algorithm for Grid Task

Author

Listed:
  • NAGLAA M. REDA

    (Ain Shams University, Cairo, Egypt)

  • A. TAWFIK

    (Modern University, Cairo, Egypt)

  • MOHAMED A. MARZOK

    (Modern University, Cairo, Egypt)

  • SOHEIR M. KHAMIS

    (Ain Shams University, Cairo, Egypt)

Abstract

Scheduling is a fundamental process for grid computing systems. Its goal is to map user tasks to suitable resources for execution. The major part of a grid scheduler is to decide which resource is suitable for each task, depending on a scheduling algorithm. Many scheduling algorithms have been designed for reaching optimality. The Suffrage algorithm has shown a superlative performance over most meta-task scheduling algorithms regarding resources selection. However, providing a full power use of resources is still a challenge. In this paper, a new heuristic algorithm is proposed. It aims to maximizing the resource utilization and minimizing the makespan. Its decision is based on detecting the maximum average value of completion times among certain tasks. These tasks are selected depending on their suffrage values. The task having the maximum average is then assigned to the resource with the minimum completion time. Experimental results show that the proposed algorithm outperforms other algorithms in terms of utilization and makespan.

Suggested Citation

  • Naglaa M. Reda & A. Tawfik & Mohamed A. Marzok & Soheir M. Khamis, 2015. "Range-Suffrage Algorithm for Grid Task," International Journal of Applied and Physical Sciences, Dr K.Vivehananthan, vol. 1(2), pages 42-50.
    • Handle: RePEc:apa:ijapss:2015:p:42-50
    DOI: 10.20469/IJAPS.50004-2
    as

    Download full text from publisher

    File URL: https://kkgpublications.com/ijaps-issue-2-article-4/
    Download Restriction: no
    File URL: https://kkgpublications.com/wp-content/uploads/2019/04/IJAPS-50004-2.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.20469/IJAPS.50004-2?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
    ---><---

    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:apa:ijapss:2015:p:42-50. 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: Dr K.Vivehananthan (email available below). General contact details of provider: https://kkgpublications.com/applied-sciences/ .

    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.