Sharing resources among periodic and aperiodic tasks with dynamic deadlines

Marco Caccamo, Giuseppe Lipari, Giorgio Buttazzo

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

Abstract

In this paper, we address the problem of scheduling hybrid task sets consisting of hard periodic and soft aperiodic tasks that may share resources in exclusive mode in a dynamic environment, where tasks are scheduled based on their deadlines. Bounded blocking on exclusive resources is achieved by means of a dynamic resource access protocol which also prevents deadblocks and chained blocking. A tunable servicing technique is used to improve aperiodic responsiveness in the presence of resource constraints. The schedulability analysis is also extended to the case in which aperiodic deadlines vary at runtime. The results achieved in this paper can also be used for developing adaptive real-time systems, where task deadlines or periods can change to conform to new load conditions.

Original languageEnglish (US)
Title of host publicationProceedings - Real-Time Systems Symposium
PublisherIEEE
Pages284-293
Number of pages10
StatePublished - 1999
Externally publishedYes
EventProceedings of the 1999 20th IEEE Real-Time Systems Symposium (RTSS'99) - Phoenix, AZ, USA
Duration: Dec 1 1999Dec 3 1999

Other

OtherProceedings of the 1999 20th IEEE Real-Time Systems Symposium (RTSS'99)
CityPhoenix, AZ, USA
Period12/1/9912/3/99

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'Sharing resources among periodic and aperiodic tasks with dynamic deadlines'. Together they form a unique fingerprint.

Cite this