Spare Capacity Distribution Using Exact Response-Time Analysis

Attila Zabos, Robert I. Davis, Alan Burns, Michael Gonz'alez Harbour

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

Abstract

Real-time systems designed for use in dynamic open environments allow applications to enter and leave the system during runtime. This leads to changing runtime scenarios where the load and the spare capacity of hardware resources is influenced by the resource demand of running applications. Flexible real-time application components, with variable temporal parameters, can adapt their timing behaviour to these changing runtime scenarios and improve both, their Quality of Service (QoS) and the utilisation of system resources. In these open systems application components are often designed independently of each other, introducing the need for system management of resources at runtime. This management requires a mechanism to distribute the available system resources among the running application components, in a way that maximises resource usage and increases QoS with respect to their importance and temporal limits. This paper introduces a runtime algorithm for the distribution of spare capacity in flexible real-time systems. The efficiency of the presented algorithm is evaluated by empirical tests and performance measurements on embedded hardware
Original languageEnglish
Title of host publicationInternational conference on Real-Time and Network Systems
Pages97-106
Publication statusPublished - Oct 2009
Event17th International Conference Real-Time and Network Systems - ECE, Paris, France
Duration: 26 Oct 200927 Oct 2009

Conference

Conference17th International Conference Real-Time and Network Systems
Country/TerritoryFrance
CityParis
Period26/10/0927/10/09

Keywords

  • real-time
  • schedulability analysis
  • fixed priority
  • spare capacity

Cite this