• DocumentCode
    908030
  • Title

    Fixed priority scheduling with limited priority levels

  • Author

    Katcher, Daniel I. ; Sathaye, Shirish S. ; Strosnider, Jay K.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA
  • Volume
    44
  • Issue
    9
  • fYear
    1995
  • fDate
    9/1/1995 12:00:00 AM
  • Firstpage
    1140
  • Lastpage
    1144
  • Abstract
    This paper develops necessary and sufficient conditions for analyzing the schedulability of fixed priority algorithms on resources with limited priority levels. We introduce the degree of schedulable saturation (Smax) as an objective function. A multimedia task set is used to demonstrate how Smax can be used to optimize the grouping of tasks to priority levels
  • Keywords
    processor scheduling; real-time systems; fixed priority algorithms; fixed priority scheduling; limited priority levels; multimedia task set; real-time systems; schedulability; schedulable saturation; Algorithm design and analysis; Backplanes; Hardware; Operating systems; Processor scheduling; Real time systems; Scheduling algorithm; Software systems; Sufficient conditions; Timing;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.464392
  • Filename
    464392
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=908030