Pages that link to "Item:Q2428689"
From MaRDI portal
The following pages link to A constant-approximate feasibility test for multiprocessor real-time scheduling (Q2428689):
Displaying 6 items.
- Assigning sporadic tasks to unrelated machines (Q494326) (← links)
- Feasibility analysis of sporadic real-time multiprocessor task systems (Q692625) (← links)
- A polynomial feasibility test for preemptive periodic scheduling of unrelated processors (Q1067785) (← links)
- Narrowing the speedup factor gap of partitioned EDF (Q2051780) (← 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)