Pages that link to "Item:Q3541088"
From MaRDI portal
The following pages link to A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling (Q3541088):
Displaying 7 items.
- Open problems in real-time scheduling (Q633550) (← links)
- Feasibility analysis of sporadic real-time multiprocessor task systems (Q692625) (← links)
- Improved multiprocessor global schedulability analysis (Q993508) (← links)
- A polynomial feasibility test for preemptive periodic scheduling of unrelated processors (Q1067785) (← links)
- Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing (Q2168774) (← links)
- Resource augmentation for uniprocessor and multiprocessor partitioned scheduling of sporadic real-time tasks (Q2251377) (← links)
- Online dynamic power management with hard real-time guarantees (Q2354765) (← links)