• DocumentCode
    2185753
  • Title

    Early-release fair scheduling

  • Author

    Anderson, James H. ; Srinivasan, Anand

  • Author_Institution
    Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    35
  • Lastpage
    43
  • Abstract
    Presents a variant of Pfair scheduling (S. Baruah et al., 1995, 1996), which we call early-release fair (ERfair) scheduling. Like conventional Pfair scheduling, ERfair scheduling algorithms can be applied to optimally schedule periodic tasks on a multiprocessor system in polynomial time. However, ERfair scheduling differs from Pfair scheduling in that it is work-conserving. As a result, average job response times may be much lower under ERfair scheduling than under Pfair scheduling, particularly in lightly loaded systems. In addition, run-time costs are lower under ERfair scheduling
  • Keywords
    computational complexity; multiprocessing systems; processor scheduling; real-time systems; ERfair scheduling algorithms; Pfair scheduling; average job response times; early-release fair scheduling; lightly loaded systems; multiprocessor system; optimal periodic task scheduling; polynomial time complexity; run-time costs; work-conserving method; Chromium;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Real-Time Systems, 2000. Euromicro RTS 2000. 12th Euromicro Conference on
  • Conference_Location
    Stockholm
  • ISSN
    1068-3070
  • Print_ISBN
    0-7695-0734-4
  • Type

    conf

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