Optimal Resource Assignment of Preemptive Periodic Tasks on Multiple Processors
From MaRDI portal
Recommendations
- Scheduling Periodic Tasks
- Scheduling preemptable tasks on parallel processors with limited availability
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
- Computing optimal preemptive schedules for parallel tasks: linear programming approaches
- Preemptive multiprocessor task scheduling with release times and time windows
Cited in
(10)- Optimal task assignment with precedence in distributed computing systems
- Optimal scheduling of progressive processing tasks
- Optimizing resource speed for two-stage real-time tasks
- The maximum gain of increasing the number of preemptions in multiprocessor scheduling
- Scheduling periodic and aperiodic tasks with time, energy harvesting and precedence constraints on multi-core systems
- Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource
- PREM-based optimal task segmentation under fixed priority scheduling
- Optimal priority assignment for aperiodic tasks with firm deadlines in fixed priority pre-emptive systems
- Optimal harmonic period assignment: complexity results and approximation algorithms
- Asymptotically optimal parallel resource assignment with interference
This page was built for publication: Optimal Resource Assignment of Preemptive Periodic Tasks on Multiple Processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376737)
