By the same authors

From the same journal

SCHEDULING HARD REAL-TIME SYSTEMS - A REVIEW

Research output: Contribution to journalLiterature review

Author(s)

Department/unit(s)

Publication details

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

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.

    Research areas

  • DISTRIBUTED SYSTEMS, TASKS, ENVIRONMENT, ALGORITHMS

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations