Pages that link to "Item:Q318911"

The following pages link to Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling (Q318911):

Displaying 6 items.

• A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling (Q283177) (← 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)
• An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems (Q1698775) (← links)
• Exact speedup factors and sub-optimality for non-preemptive scheduling (Q1698782) (← links)
• Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing (Q2168774) (← links)