Zero-laxity based real-time multiprocessor scheduling
Journal of Systems and Software
Partially non-preemptive dual priority multiprocessor scheduling
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
On using adversary simulators to obtain tight lower bounds for response times
Proceedings of the 27th Annual ACM Symposium on Applied Computing
FPSL, FPCL and FPZL schedulability analysis
Real-Time Systems
Journal of Systems and Software
Contention-free executions for real-time multiprocessor scheduling
ACM Transactions on Embedded Computing Systems (TECS) - Special Section ESFH'12, ESTIMedia'11 and Regular Papers
A scheduling algorithm to reduce the static energy consumption of multiprocessor real-time systems
Proceedings of the 21st International conference on Real-Time Networks and Systems
Demand-based schedulability analysis for real-time multi-core scheduling
Journal of Systems and Software
Hi-index | 0.00 |
This paper presents the Fixed Priority until Zero Laxity (FPZL) scheduling algorithm for multiprocessor realtime 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 pseudopolynomial 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 task sets 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.