IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v26y1978i1p127-140.html
   My bibliography  Save this article

On a Real-Time Scheduling Problem

Author

Listed:
  • Sudarshan K. Dhall

    (Murray State University, Murray, Kentucky)

  • C. L. Liu

    (University of Illinois, Urbana, Illinois)

Abstract

We study the problem of scheduling periodic-time-critical tasks on multiprocessor computing systems. A periodic-time-critical task consists of an infinite number of requests, each of which has a prescribed deadline. The scheduling problem is to specify an order in which the requests of a set of tasks are to be executed and the processor to be used, with the goal of meeting all the deadlines with a minimum number of processors. Since the problem of determining the minimum number of processors is difficult, we consider two heuristic algorithms. These are easy to implement and yield a number of processors that is reasonably close to the minimum number. We also analyze the worst-case behavior of these heuristics.

Suggested Citation

  • Sudarshan K. Dhall & C. L. Liu, 1978. "On a Real-Time Scheduling Problem," Operations Research, INFORMS, vol. 26(1), pages 127-140, February.
    • Handle: RePEc:inm:oropre:v:26:y:1978:i:1:p:127-140
    DOI: 10.1287/opre.26.1.127
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.26.1.127
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.26.1.127?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
    ---><---

    Citations

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


    Cited by:

    1. Bondarev, B.V., 1992. "Quantum Markovian master equation theory of particle migration in a stochastic medium," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 183(1), pages 159-174.
    2. Kreimer, Joseph, 2000. "Real-time multiserver system with two non-identical channels and limited maintenance facilities," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 53(1), pages 85-94.
    3. Bertossi, Alan A. & Fusiello, Andrea, 1997. "Rate-monotonic scheduling for hard-real-time systems," European Journal of Operational Research, Elsevier, vol. 96(3), pages 429-443, February.
    4. Gorini, Vittorio & Verri, Maurizio & Frigerio, Alberto, 1989. "Non-markovian behavior in low-temperature damping," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 161(2), pages 357-384.
    5. Tzafestas, Spyros & Triantafyllakis, Alekos, 1993. "Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(5), pages 397-434.
    6. Łuczka, Jerzy, 1988. "On Markovian kinetic equations: Zubarev's nonequilibrium statistical operator approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 149(1), pages 245-266.
    7. Schmutz, M., 1980. "Jahn-Teller systems as displaced para-Bose oscillators," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 101(1), pages 1-21.
    8. Pianykh, Oleg S. & Perez, Sebastian & Zhang, Chengzhao “Richard”, 2024. "Discrete scheduling and critical utilization," European Journal of Operational Research, Elsevier, vol. 312(2), pages 445-455.
    9. Ianovsky, Edward & Kreimer, Joseph, 2003. "Optimization of real-time multiserver system with two different channels and shortage of maintenance facilities," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 63(6), pages 615-627.

    More about this item

    Statistics

    Access and download statistics

    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:inm:oropre:v:26:y:1978:i:1:p:127-140. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.