Pages that link to "Item:Q1115592"
From MaRDI portal
The following pages link to A new algorithm for scheduling periodic, real-time tasks (Q1115592):
Displaying 11 items.
- {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling (Q436211) (← links)
- Feasibility problems for recurring tasks on one processor (Q688715) (← links)
- Optimal virtual cluster-based multiprocessor scheduling (Q1039304) (← links)
- LSTF: A new scheduling policy for complex real-time tasks in multiple processor systems (Q1360477) (← links)
- Automated competitive analysis of real-time scheduling with graph games (Q1698779) (← links)
- Proportionate progress: A notion of fairness in resource allocation (Q1918992) (← links)
- A new fair scheduling algorithm for periodic tasks on multiprocessors (Q1944888) (← links)
- Laxity dynamics and LLF schedulability analysis on multiprocessor platforms (Q2251352) (← links)
- FPSL, FPCL and FPZL schedulability analysis (Q2251353) (← links)
- Schedulers for larger classes of pinwheel instances (Q2366229) (← links)
- Efficient scheduling of periodic information monitoring requests (Q2496080) (← links)
