Pages that link to "Item:Q1149764"

The following pages link to Scheduling periodically occurring tasks on multiple processors (Q1149764):

Displaying 10 items.

• Feasibility analysis under fixed priority scheduling with limited preemptions (Q554013) (← links)
• Feasibility problems for recurring tasks on one processor (Q688715) (← links)
• The basic cyclic scheduling problem with deadlines (Q806665) (← links)
• A polynomial feasibility test for preemptive periodic scheduling of unrelated processors (Q1067785) (← links)
• A new algorithm for scheduling periodic, real-time tasks (Q1115592) (← links)
• Preemptive scheduling of periodic jobs in uniform multiprocessor systems (Q1172385) (← links)
• MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling (Q1330422) (← links)
• Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems (Q1918993) (← links)
• Schedulers for larger classes of pinwheel instances (Q2366229) (← links)
• Real-time task scheduling for energy-aware embedded systems (Q5952843) (← links)