Deadline-aware programming and scheduling

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Deadlines are the most important events in real-time systems. Real-time programs must therefore be aware of deadlines, and be able to identify and react to missed deadlines. Moreover, Earliest Deadline First (EDF) is the most widely studied optimal dynamic scheduling algorithm for uniprocessor real-time systems. In this paper we explore how a resource sharing protocol (called the DFP - Deadline Floor inheritance Protocol), which has been proposed for languages such as Ada, can be incorporated into the language's definition. We also address the programming of systems that have mixed scheduling (e.g. fixed priority and EDF). The incorporation of the DFP into Ada requires some changes to the current predefined packages. These changes are also of use in supporting the programming of deadline-aware systems even when not scheduling by EDF.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer
Pages107-118
Number of pages12
Volume8454 LNCS
ISBN (Print)9783319083100
DOIs
Publication statusPublished - 2014
Event19th International Conference on Reliable Software Technologies, Ada-Europe 2014 - Paris, United Kingdom
Duration: 23 Jun 201427 Jun 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8454 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Conference

Conference19th International Conference on Reliable Software Technologies, Ada-Europe 2014
Country/TerritoryUnited Kingdom
CityParis
Period23/06/1427/06/14

Cite this