Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme
From MaRDI portal
Publication:438181
Recommendations
- Partitioned EDF scheduling: a closer look
- Partitioned EDF scheduling on a few types of unrelated multiprocessors
- Utilization bounds for EDF scheduling on real-time multiprocessor systems
- Narrowing the speedup factor gap of partitioned EDF
- Priority-driven scheduling of periodic task systems on multiprocessors
Cites work
- A survey of hard real-time scheduling for multiprocessor systems
- Feasibility problems for recurring tasks on one processor
- Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
- Measuring the performance of schedulability tests
- Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
- New Algorithms for Bin Packing
- Schedulability Analysis for Real-Time Systems with EDF Scheduling
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Cited in
(8)- FPSL, FPCL and FPZL schedulability analysis
- Architecture aware semi partitioned real-time scheduling on multicore platforms
- Partitioned EDF scheduling: a closer look
- Partitioned EDF scheduling on a few types of unrelated multiprocessors
- Implementation and evaluation of global and partitioned scheduling in a real-time OS
- Multiprocessor real-time scheduling with arbitrary processor affinities: from practice to theory
- Unified overhead-aware schedulability analysis for slot-based task-splitting
- Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems
This page was built for publication: Partitioned EDF scheduling for multiprocessors using a \(C=D\) task splitting scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438181)
