IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v20y2017i3d10.1007_s10951-016-0483-z.html
   My bibliography  Save this article

Optimal scheduling of contract algorithms with soft deadlines

Author

Listed:
  • Spyros Angelopoulos

    (Sorbonne Universités, UPMC Univ Paris 06, UMR 7606, LIP6
    CNRS, UMR 7606, LIP6)

  • Alejandro López-Ortiz

    (University of Waterloo)

  • Angèle Hamel

    (Wilfrid Laurier University)

Abstract

A contract algorithm is an algorithm which is given, as part of its input, a specified amount of allowable computation time, and may not return useful results if interrupted prior to that time. In contrast, an interruptible algorithm will always output some meaningful (albeit suboptimal) solution, even if interrupted during its execution. Simulating interruptible algorithms by means of schedules of executions of contract algorithms in parallel processors is a well-studied problem with significant applications in AI. In the standard model, the interruptions are hard deadlines in which a solution must be reported immediately at the time the interruption occurs. In this paper, we study the more general setting of scheduling contract algorithms in the presence of soft deadlines. In particular, we address the setting in which if an interruption occurs at time t, then the system is given an additional window of time $$w(t)\le c \cdot t$$ w ( t ) ≤ c · t , for constant c, within which the simulation must be completed. We formulate extensions to performance measures of schedules under this setting and derive schedules of optimal performance for all concave functions w.

Suggested Citation

  • Spyros Angelopoulos & Alejandro López-Ortiz & Angèle Hamel, 2017. "Optimal scheduling of contract algorithms with soft deadlines," Journal of Scheduling, Springer, vol. 20(3), pages 267-277, June.
    • Handle: RePEc:spr:jsched:v:20:y:2017:i:3:d:10.1007_s10951-016-0483-z
    DOI: 10.1007/s10951-016-0483-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-016-0483-z
    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/s10951-016-0483-z?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.

    Citations

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


    Cited by:

    1. Spyros Angelopoulos & Alejandro López-Ortiz, 2020. "Interruptible algorithms for multiproblem solving," Journal of Scheduling, Springer, vol. 23(4), pages 451-464, August.

    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:jsched:v:20:y:2017:i:3:d:10.1007_s10951-016-0483-z. 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.