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

Scheduling with task replication on desktop grids: theoretical and experimental analysis

Author

Listed:
  • Eduardo C. Xavier

    (University of Campinas (UNICAMP))

  • Robson R. S. Peixoto

    (University of Campinas (UNICAMP))

  • Jefferson L. M. Silveira

    (University of Campinas (UNICAMP))

Abstract

Our main objective in this paper is to study the possible benefits of using task replication when generating a schedule in a desktop grid. We consider the problem of constructing a schedule in an environment where machines’ speeds may be unpredictable and the objective is to minimize the makespan of the schedule. Another considered objective is to minimize the total processor cycle consumption. First we provide a theoretical study of a well known algorithm that makes use of replication: the WQRxx algorithm. We prove approximation ratios for this algorithm in different scenarios, and also show that such ratios are tight. We propose a simple interface and show how to add replication to any scheduling algorithm using this interface. We also prove approximation ratios for any algorithm that uses this interface. We then extend several well known algorithms to generate schedules with replication via the interface, and present computational simulations comparing the quality of the solutions of these algorithms with the addition of replication.

Suggested Citation

  • Eduardo C. Xavier & Robson R. S. Peixoto & Jefferson L. M. Silveira, 2015. "Scheduling with task replication on desktop grids: theoretical and experimental analysis," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 520-544, October.
    • Handle: RePEc:spr:jcomop:v:30:y:2015:i:3:d:10.1007_s10878-013-9650-8
    DOI: 10.1007/s10878-013-9650-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-013-9650-8
    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-9650-8?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.

    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-9650-8. 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: 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.