• DocumentCode
    1497510
  • Title

    Comment on "On-line scheduling policies for a class of IRIS real-time tasks"

  • Author

    Choi, Kyunghee ; Jung, Gihyun

  • Author_Institution
    Sch. of Inf. & Comput. Eng., Ajou Univ., Suwon, South Korea
  • Volume
    50
  • Issue
    5
  • fYear
    2001
  • fDate
    5/1/2001 12:00:00 AM
  • Firstpage
    526
  • Lastpage
    528
  • Abstract
    Scheduling policies for real-time tasks which receive rewards that depend on the amount of service received were presented by Dey et al.(1996). The policies utilized heuristic approaches to maximize the total accrued reward. In this comment, we propose an extension of their work that may reduce the average computational complexity.
  • Keywords
    computational complexity; scheduling; computational complexity; scheduling policies; Computational complexity; Iris; Processor scheduling; Scheduling algorithm;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.926165
  • Filename
    926165
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1497510