Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme
From MaRDI portal
Publication:438181
DOI10.1007/S11241-011-9126-9zbMATH Open1243.68101OpenAlexW2085383769MaRDI QIDQ438181FDOQ438181
P. Wang, A. Burns, F. Zhang, R. I. Davis
Publication date: 30 July 2012
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11241-011-9126-9
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
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
- Schedulability Analysis for Real-Time Systems with EDF Scheduling
- Measuring the performance of schedulability tests
- New Algorithms for Bin Packing
- Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
- Feasibility problems for recurring tasks on one processor
Cited In (6)
- Implementation and evaluation of global and partitioned scheduling in a real-time OS
- FPSL, FPCL and FPZL schedulability analysis
- Multiprocessor real-time scheduling with arbitrary processor affinities: from practice to theory
- Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems
- Architecture aware semi partitioned real-time scheduling on multicore platforms
- Unified overhead-aware schedulability analysis for slot-based task-splitting
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)