Abstract
Earliest Deadline First (EDF) is the most widely studied optimal dynamic scheduling algorithm for uniprocessor real-time systems. In the existing literature, however, there is no complete exact analysis for EDF scheduling when both resource sharing and release jitter are considered. Since resource sharing and release jitter are important characteristics of embedded real-time systems, a solid theoretical foundation should be provided for EDF scheduled systems. In this paper, we extend traditional processor demand analysis to let arbitrary deadline real-time tasks share non-preemptable resources and suffer release jitter. A complete and exact schedulability analysis for EDF scheduled systems is provided. This analysis is incorporated into QPA (Quick Processor-demand Analysis) which provides an efficient implementation of the exact test.
| Original language | English |
|---|---|
| Article number | 67 |
| Pages (from-to) | 67-1-67-18 |
| Journal | ACM Transactions in Embedded Computing Systems |
| Volume | 12 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - Mar 2013 |
Keywords
- Algorithms
- Control and reliability
- Earliest deadline first
- Embedded and real-time systems
- Resource sharing
- Schedulability analysis
- Scheduling