Unified overhead-aware schedulability analysis for slot-based task-splitting
From MaRDI portal
(Redirected from Publication:488236)
Recommendations
- Semi-partitioned scheduling of dynamic real-time workload: a practical approach based on analysis-driven load balancing
- {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling
- Partitioned EDF scheduling for multiprocessors using a \(C=D\) task splitting scheme
- Multiprocessor scheduling for real-time systems
- Improved multiprocessor global schedulability analysis
Cites work
- Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems
- Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
- Partitioned EDF scheduling for multiprocessors using a \(C=D\) task splitting scheme
- Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound
- Proportionate progress: A notion of fairness in resource allocation
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Cited in
(3)
This page was built for publication: Unified overhead-aware schedulability analysis for slot-based task-splitting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q488236)