Abstract
This paper presents the Fixed Priority until Zero Laxity (FPZL) scheduling algorithm for multiprocessor real-time systems. FPZL is similar to global fixed priority preemptive scheduling; however, whenever a task reaches a state
of zero laxity it is given the highest priority. FPZL is a minimally dynamic algorithm, in that the priority of a job can change at most once during its execution, bounding the number of pre-emptions. Polynomial time and pseudo-polynomial time sufficient schedulability tests are derived for FPZL. These tests are then improved by computing upper bounds on the amount of execution that each task can perform in the zero laxity state. An empirical evaluation shows that
FPZL is highly effective, with a significantly larger number of tasksets deemed schedulable by the tests derived in this paper, than by state-of-the-art schedulability tests for Earliest Deadline until Zero Laxity (EDZL) scheduling.
of zero laxity it is given the highest priority. FPZL is a minimally dynamic algorithm, in that the priority of a job can change at most once during its execution, bounding the number of pre-emptions. Polynomial time and pseudo-polynomial time sufficient schedulability tests are derived for FPZL. These tests are then improved by computing upper bounds on the amount of execution that each task can perform in the zero laxity state. An empirical evaluation shows that
FPZL is highly effective, with a significantly larger number of tasksets deemed schedulable by the tests derived in this paper, than by state-of-the-art schedulability tests for Earliest Deadline until Zero Laxity (EDZL) scheduling.
| Original language | English |
|---|---|
| Title of host publication | IEEE Real-Time and Embedded Technology and Applications Symposium |
| Pages | 245-256 |
| Number of pages | 12 |
| DOIs | |
| Publication status | Published - Apr 2011 |
Keywords
- fpzl
- multiprocessor
- multicore
- schedulability analysis
- scheduling
- real-time