Repository logo
 
Loading...
Thumbnail Image
Publication

Uniprocessor EDF scheduling with mode change

Use this identifier to reference this record.
Name:Description:Size:Format: 
CAPL_BjornAndersson_2008_CISTER.pdf258.3 KBAdobe PDF Download

Advisor(s)

Abstract(s)

Consider the problem of scheduling sporadically-arriving tasks with implicit deadlines using Earliest-Deadline-First (EDF) on a single processor. The system may undergo changes in its operational modes and therefore the characteristics of the task set may change at run-time. We consider a well-established previously published mode-change protocol and we show that if every mode utilizes at most 50% of the processing capacity then all deadlines are met. We also show that there exists a task set that misses a deadline although the utilization exceeds 50% by just an arbitrarily small amount. Finally, we present, for a relevant special case, an exact schedulability test for EDF with mode change.

Description

Keywords

Citation

Research Projects

Organizational Units

Journal Issue