Sensitivity analysis of the minimum task period for arbitrary deadline real-time systems

  • Fengxiang Zhang
  • , Alan Burns
  • , Sanjoy Baruah

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

The most important character of real-time systems is that they have stringent timing deadlines that must be guaranteed. A hard real-time system is required to complete its operations before all its timing deadlines. For a given task set, it is useful in an engineering context to know what changes to period can be made to a task that will deliver a schedulable system. In this paper, we develop the sensitivity analysis of task period for EDF scheduled systems on a uniprocessor. We prove that a minimum task period can be determined by a single pass of the QPA algorithm; an improved scheme is presented by using different initial values of the period. The approaches developed for sensitivity analysis of task period are therefore as efficient as QPA, and are easily incorporated into a system design support tool.

Original languageEnglish
Title of host publicationProceedings - 16th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2010
Pages101-108
Number of pages8
DOIs
StatePublished - 2010
Event16th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2010 - Tokyo, Japan
Duration: Dec 13 2010Dec 15 2010

Publication series

NameProceedings - 16th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2010

Conference

Conference16th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2010
Country/TerritoryJapan
CityTokyo
Period12/13/1012/15/10

Keywords

  • Performance and reliability
  • Real-time and embedded systems
  • System design and control

Fingerprint

Dive into the research topics of 'Sensitivity analysis of the minimum task period for arbitrary deadline real-time systems'. Together they form a unique fingerprint.

Cite this