A Unified Hard/Soft Real-Time Schedulability Test for Global EDF Multiprocessor Scheduling
Authors:
- Hennadiy LeontyevHLHennadiy Leontyev
- James H. AndersonJAJames H. Anderson
- 1 November 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10528725,p. 375-384
Abstract
The issue of deadline tardiness is considered under earliest-deadline-first (GEDF) multiprocessor scheduling. New schedulability tests are presented for determining whether a set of sporadic tasks with arbitrary relative deadlines can be scheduled under either preemptive or non-preemptive GEDF so that pre-defined tardiness bounds are met. These tests are of pseudo-polynomial time complexity, and can be used in hard real-time, soft real-time, and mixed contexts.Keywords
This publication has 7 references indexed in Scilit:
- Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor PlatformsIEEE Transactions on Parallel and Distributed Systems, 2008
- Global EDF Schedulability Analysis of Arbitrary Sporadic Task Systems2008
- Techniques for Multiprocessor Global Schedulability Analysis2007
- Tardiness Bounds under Global EDF Scheduling on a Multiprocessor2006
- The Non-preemptive Scheduling of Periodic Tasks upon MultiprocessorsReal-Time Systems, 2006
- Flexible tardiness bounds for sporadic real-time task systems on multiprocessors2006
- Multiprocessor EDF and deadline monotonic schedulability analysis2004