• DocumentCode
    2954441
  • Title

    Static-priority scheduling of multiframe tasks

  • Author

    Baruah, Sanjoy K. ; Chen, Deji ; Mok, Aloysius

  • Author_Institution
    Vermont Univ., Burlington, VT, USA
  • fYear
    1999
  • fDate
    1999
  • Firstpage
    38
  • Lastpage
    45
  • Abstract
    The multiframe model of hard-real-time tasks is a generalization of the well-known periodic task model of C. Liu and J. Layland (1973). The feasibility analysis of systems of multiframe tasks which are assigned priorities according to the rate-monotonic priority assignment scheme is studied. An efficient sufficient feasibility test for such systems of multiframe tasks is presented and proved correct-this generalizes a result of A.K. Mok and D. Chen (1997)
  • Keywords
    multiprogramming; processor scheduling; software engineering; feasibility analysis; feasibility test; hard-real-time tasks; multiframe model; multiframe tasks; rate-monotonic priority assignment scheme; static-priority scheduling; Character generation; Power system modeling; Processor scheduling; Real time systems; Runtime; Scheduling algorithm; System testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Real-Time Systems, 1999. Proceedings of the 11th Euromicro Conference on
  • Conference_Location
    York
  • ISSN
    1068-3070
  • Print_ISBN
    0-7695-0240-7
  • Type

    conf

  • DOI
    10.1109/EMRTS.1999.777448
  • Filename
    777448
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2954441