IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v1y1998i4d10.1023_a1009703014438.html
   My bibliography  Save this article

Optimal Randomized Scheduling by Replacement

Author

Listed:
  • Isaac Saias

    (Los Alamos National Laboratory)

Abstract

In the replacement scheduling problem, a system consists of n processors drawn from a pool of p,all initially “alive”. At any time some processor can die. The scheduler is immediately informed of the fault butnot of its location. It must then choose another set of n processors. If this new set contains a dead processor, the system crashes and halts. The performance of a scheduling protocol is measured by the expected number of deaths the system tolerates before it crashes. We provide an optimal randomized scheduling protocol for this problem. The framework of this work combines an absolute performance measure for protocols and so-called adaptive online adversaries. This framework is rarely addressed because of the complexity of the interaction between protocols and adversaries. A major contribution of ourwork is to provide a theoretical foundation for the analysis of this interaction. In particular we make explicit how the protocol and the adversary affect the probability distribution of the analysis—a very general problem. We carefully analyze the exchange of sinformation between the two players, and reveal how they use their information optimally. The optimality of the protocol is established by using of a saddle point method for protocols and adversaries.

Suggested Citation

  • Isaac Saias, 1998. "Optimal Randomized Scheduling by Replacement," Journal of Combinatorial Optimization, Springer, vol. 1(4), pages 427-456, December.
    • Handle: RePEc:spr:jcomop:v:1:y:1998:i:4:d:10.1023_a:1009703014438
    DOI: 10.1023/A:1009703014438
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1009703014438
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1009703014438?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:1:y:1998:i:4:d:10.1023_a:1009703014438. 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.