Pages that link to "Item:Q688715"
From MaRDI portal
The following pages link to Feasibility problems for recurring tasks on one processor (Q688715):
Displayed 3 items.
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible (Q987535) (← links)
- A schedulable utilization bound for the multiprocessor \(\mathsf{EPDF}\) Pfair algorithm (Q2479889) (← links)
- A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling (Q3541088) (← links)