• DocumentCode
    3244839
  • Title

    Three obstacles to flexible scheduling

  • Author

    Bernat, Guillem ; Burns, Alan

  • Author_Institution
    Dept. of Comput. Sci., York Univ., UK
  • fYear
    2001
  • fDate
    2001
  • Firstpage
    11
  • Lastpage
    18
  • Abstract
    The key to the next generation real-time systems is flexible scheduling mechanisms that guarantee hard deadlines and use available spare resources to maximise total system utility. This is a multicriteria scheduling problem. It is argued that common approaches like eager slack usage and mandatory first schemes are not only not optimal but nor adequate for a wide class of process models. It is also shown that a late acceptance test model is preferable to an early acceptance test model due to the uncertainty of future behaviour of the system. The discussion is complemented with simulation results
  • Keywords
    processor scheduling; real-time systems; eager slack usage; flexible scheduling; hard deadlines; late acceptance test model; mandatory first schemes; multicriteria scheduling; real-time systems; spare resources; total system utility; Computational modeling; Computer science; Dynamic scheduling; Load management; Processor scheduling; Real time systems; Resource management; Runtime; System testing; Uncertainty;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Real-Time Systems, 13th Euromicro Conference on, 2001.
  • Conference_Location
    Delft
  • Print_ISBN
    0-7695-1221-6
  • Type

    conf

  • DOI
    10.1109/EMRTS.2001.933990
  • Filename
    933990