A synthetic utilization bound for aperiodic tasks with resource requirements

Tarek Abdelzaher, V. Sharma

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

Abstract

Utilization bounds for schedulability of aperiodic tasks are new in real-time scheduling literature. All aperiodic bounds known to date apply only to independent tasks. They either assume a liquid task model (one with infinitely many infinitesimal tasks) or are limited to deadline-monotonic and earliest-deadline first scheduling. In this paper, the authors make two important contributions. First, they derive the first aperiodic utilization bound that considers a task model with resource requirements. Second, the new bound is a function of a parameter called preemptable deadline ratio that depends on the scheduling policy. We show that many scheduling policies can be classified by this parameter allowing per-policy bounds to be derived. Simulation results demonstrating the applicability of aperiodic utilization bounds are presented.

Original languageEnglish (US)
Title of host publicationProceedings - 15th Euromicro Conference on Real-Time Systems, ECRTS 2003
Pages141-150
Number of pages10
DOIs
StatePublished - Dec 1 2003
Externally publishedYes
Event15th Euromicro Conference on Real-Time Systems, ECRTS 2003 - Porto, Portugal
Duration: Jul 2 2003Jul 4 2003

Publication series

NameProceedings - Euromicro Conference on Real-Time Systems
ISSN (Print)1068-3070

Other

Other15th Euromicro Conference on Real-Time Systems, ECRTS 2003
CountryPortugal
CityPorto
Period7/2/037/4/03

Keywords

  • Real-time scheduling
  • aperiodic tasks
  • schedulability analysis
  • utilization bounds

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'A synthetic utilization bound for aperiodic tasks with resource requirements'. Together they form a unique fingerprint.

Cite this