Exploiting skips in periodic tasks for enhancing aperiodic responsiveness

Marco Caccamo, G. Buttazzo

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


In certain real-time applications, ranging from multimedia to telecommunication systems, timing constraints can be more flexible than scheduling theory usually permits. For example, in video reception, missing a deadline is acceptable, provided that most deadlines are met. In this paper, we deal with the problem of scheduling hybrid sets of tasks, consisting of firm periodic tasks (i.e., tasks with deadlines which can occasionally skip one instance) and soft aperiodic requests, which have to be served as soon as possible to minimize their average response time. We propose and analyze an algorithm, based on a variant of Earliest Deadline First scheduling, which exploits skips to enhance the response time of aperiodic requests. Schedulability bounds are also derived to perform off-line analysis.

Original languageEnglish (US)
Title of host publicationProceedings - Real-Time Systems Symposium
Editors Anon
Number of pages10
StatePublished - 1997
Externally publishedYes
EventProceedings of the 1997 18th IEEE Real-Time Systems Symposium - San Francisco, CA, USA
Duration: Dec 2 1997Dec 5 1997


OtherProceedings of the 1997 18th IEEE Real-Time Systems Symposium
CitySan Francisco, CA, USA

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture


Dive into the research topics of 'Exploiting skips in periodic tasks for enhancing aperiodic responsiveness'. Together they form a unique fingerprint.

Cite this