SCHEDULING HARD REAL-TIME SYSTEMS - A REVIEW

Research output: Contribution to journalLiterature reviewpeer-review

Abstract

Recent results in the application of scheduling theory to hard real-time systems are reviewed in this paper. The review takes the form of an analysis of the problems presented by different application requirements and characteristics. Issues covered include uniprocessor and multiprocessor systems, periodic and aperiodic processes, static and dynamic algorithms, transient overloads and resource usage. Protocols that limit and reduce blocking are discussed. Consideration is also given to scheduling Ada tasks.

Original languageEnglish
Pages (from-to)116-128
Number of pages13
JournalSoftware Engineering Journal
Volume6
Issue number3
Publication statusPublished - May 1991

Keywords

  • DISTRIBUTED SYSTEMS
  • TASKS
  • ENVIRONMENT
  • ALGORITHMS

Cite this