Pages that link to "Item:Q1033671"
From MaRDI portal
The following pages link to Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling (Q1033671):
Displaying 7 items.
- Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling (Q318911) (← links)
- Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling (Q436216) (← links)
- Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms (Q497994) (← links)
- Power efficient rate monotonic scheduling for multi-core systems (Q663432) (← links)
- Exact speedup factors and sub-optimality for non-preemptive scheduling (Q1698782) (← links)
- Real-time scheduling with resource sharing on heterogeneous multiprocessors (Q2251407) (← links)
- The limited-preemptive feasibility of real-time tasks on uniprocessors (Q2356291) (← links)
