Pages that link to "Item:Q688715"

The following pages link to Feasibility problems for recurring tasks on one processor (Q688715):

Displaying 7 items.

• Partitioned EDF scheduling for multiprocessors using a \(C=D\) task splitting scheme (Q438181) (← links)
• A bandwidth allocation scheme for compositional real-time systems with periodic resources (Q438190) (← links)
• Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible (Q987535) (← links)
• A constant-approximate feasibility test for multiprocessor real-time scheduling (Q2428689) (← links)
• A schedulable utilization bound for the multiprocessor \(\mathsf{EPDF}\) Pfair algorithm (Q2479889) (← links)
• Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems (Q2796402) (← links)
• A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling (Q3541088) (← links)