IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v159y2008i1p41-5110.1007-s10479-007-0279-9.html
   My bibliography  Save this article

Periodic real-time scheduling: from deadline-based model to latency-based model

Author

Listed:
  • Liliana Cucu
  • Nicolas Pernet
  • Yves Sorel

Abstract

This paper presents a connection between two real-time models: a deadline-based model and a latency-based model. The importance of the latency-based model is proved through a result showing that two deadlines, instead of a latency constraint, over-constrain the real-time applications. Moreover, we give a deadline-marking algorithm based on the relation between deadlines and latency constraints. This algorithm provides non-preemptive feasible schedules for systems with precedence constraints and deadlines, or more complex systems with deadlines and latencies. This is the first step toward non-preemptive schedulability for distributed architectures (without over-constraining the system) like, for example, the automotive applications using protocols such as Controller Area Network (CAN). Copyright Springer Science+Business Media, LLC 2008

Suggested Citation

  • Liliana Cucu & Nicolas Pernet & Yves Sorel, 2008. "Periodic real-time scheduling: from deadline-based model to latency-based model," Annals of Operations Research, Springer, vol. 159(1), pages 41-51, March.
    • Handle: RePEc:spr:annopr:v:159:y:2008:i:1:p:41-51:10.1007/s10479-007-0279-9
    DOI: 10.1007/s10479-007-0279-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-007-0279-9
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-007-0279-9?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. Jan Korst & Emile Aarts & Jan Karel Lenstra, 1996. "Scheduling Periodic Tasks," INFORMS Journal on Computing, INFORMS, vol. 8(4), pages 428-435, November.
    Full references (including those not matched with items on IDEAS)

    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. Zeng, Daniel D. & Dror, Moshe & Chen, Hsinchun, 2006. "Efficient scheduling of periodic information monitoring requests," European Journal of Operational Research, Elsevier, vol. 173(2), pages 583-599, September.

    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:annopr:v:159:y:2008:i:1:p:41-51:10.1007/s10479-007-0279-9. 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.