Pages that link to "Item:Q294728"
From MaRDI portal
The following pages link to Liu and Layland's schedulability test revisited (Q294728):
Displaying 13 items.
- Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling (Q318911) (← links)
- Utilization bound for periodic task set with composite deadline (Q612769) (← links)
- Commentary to: ``An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems'' (Q779470) (← links)
- Measuring the performance of schedulability tests (Q813145) (← links)
- Solution of the Liu-Layland problem via bottleneck just-in-time sequencing (Q880504) (← links)
- Lowest priority first based feasibility analysis of real-time systems (Q897377) (← links)
- Apportionment methods and the Liu-Layland problem (Q954936) (← links)
- Rate monotonic scheduling re-analysed (Q991759) (← links)
- Errata: A new algorithm for scheduling periodic, real-time tasks (Q1587777) (← links)
- Comments on ``Generalized rate monotonic schedulability bounds using relative period ratios'' (Q1944894) (← links)
- Narrowing the speedup factor gap of partitioned EDF (Q2051780) (← links)
- Reply to: ``Comments on `Supervisory control for real-time scheduling of periodic and sporadic tasks with resource constraints' ''. (Q2409118) (← links)
- Rate monotonic schedulability tests using period-dependent conditions (Q2460198) (← links)
