Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors
Real-Time Systems
Validating timing constraints in multiprocessor and distributed systems
Validating timing constraints in multiprocessor and distributed systems
Multiprocessor EDF and Deadline Monotonic Schedulability Analysis
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Improved Schedulability Analysis of EDF on Multiprocessor Platforms
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
IEICE - Transactions on Information and Systems
Predictability of Earliest Deadline Zero Laxity Algorithm for Multiprocessor Real-Time Systems
ISORC '06 Proceedings of the Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
ECRTS '07 Proceedings of the 19th Euromicro Conference on Real-Time Systems
Brute-force determination of multiprocessor schedulability for sets of sporadic hard-deadline tasks
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
Zero-laxity based real-time multiprocessor scheduling
Journal of Systems and Software
FPSL, FPCL and FPZL schedulability analysis
Real-Time Systems
Contention-free executions for real-time multiprocessor scheduling
ACM Transactions on Embedded Computing Systems (TECS) - Special Section ESFH'12, ESTIMedia'11 and Regular Papers
Limited carry-in technique for real-time multi-core scheduling
Journal of Systems Architecture: the EUROMICRO Journal
Demand-based schedulability analysis for real-time multi-core scheduling
Journal of Systems and Software
| Hi-index | 0.00 |
A schedulability test is derived for the global Earliest Deadline Zero Laxity (EDZL) scheduling algorithm on a platform with multiple identical processors. The test is sufficient, but not necessary, to guarantee that a system of independent sporadic tasks with arbitrary deadlines will be successfully scheduled, with no missed deadlines, by the multiprocessor EDZL algorithm. Global EDZL is known to be at least as effective as global Earliest-Deadline-First (EDF) in scheduling task sets to meet deadlines. It is shown, by testing on large numbers of pseudo-randomly generated task sets, that the combination of EDZL and the new schedulability test is able to guarantee that far more task sets meet deadlines than the combination of EDF and known EDF schedulability tests.In the second part of the paper, an improved version of the EDZL-schedulability test is presented. This new algorithm is able to efficiently exploit information on the slack values of interfering tasks, to iteratively refine the estimation of the interference a task can be subjected to. This iterative algorithm is shown to have better performance than the initial test, in terms of schedulable task sets detected.