Abstract
This letter proves the finish time predictability of EDZL (Earliest Deadline Zero Laxity) scheduling algorithm for multiprocessor real-time systems, which is a variant of EDF. Based on the results, it also shows that EDZL can successfully schedule any periodic task set if its total utilization is not greater than (m + 1)/2, where m is the number of processors.
| Original language | English |
|---|---|
| Pages (from-to) | 2981-2984 |
| Number of pages | 4 |
| Journal | IEICE Transactions on Information and Systems |
| Volume | E89-D |
| Issue number | 12 |
| DOIs | |
| State | Published - Dec 2006 |
| Externally published | Yes |
Keywords
- Earliest Deadline Zero Laxity
- Embedded real-time system
- Finish time predictability
- Multiprocessor
- Priority-driven scheduling
Fingerprint
Dive into the research topics of 'Finish time predictability of earliest Deadline Zero Laxity algorithm for multiprocessor real-time systems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver