• DocumentCode
    3133129
  • Title

    Guaranteeing timing constraints under shortest remaining processing time scheduling

  • Author

    Davis, R.I. ; Burns, A. ; Walker, W.

  • Author_Institution
    Dept. of Comput. Sci., York Univ., UK
  • fYear
    1997
  • fDate
    11-13 Jun 1997
  • Firstpage
    88
  • Lastpage
    93
  • Abstract
    The scheduling scheme “shortest remaining processing time” (SRPT) has the advantage that it minimises mean response times. We present feasibility tests for SRPT that will enable this scheduling approach to be used for real time systems. Examples are given of task sets that are schedulable under SRPT but not by fixed priority based scheduling
  • Keywords
    minimisation; real-time systems; scheduling; SRPT; feasibility tests; fixed priority based scheduling; mean response times; real time systems; scheduling approach; scheduling scheme; shortest remaining processing time scheduling; task sets; timing constraint guarantee; Computer science; Concurrency control; Delay; Processor scheduling; Protocols; Real time systems; Scheduling algorithm; System testing; Time factors; Timing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Real-Time Systems, 1997. Proceedings., Ninth Euromicro Workshop on
  • Conference_Location
    Toledo
  • Print_ISBN
    0-8186-8034-2
  • Type

    conf

  • DOI
    10.1109/EMWRTS.1997.613768
  • Filename
    613768
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3133129