Pages that link to "Item:Q656084"

The following pages link to Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound (Q656084):

Displaying 13 items.

• A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling (Q283177) (← links)
• Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems (Q298048) (← links)
• CPU scheduling and memory management for interactive real-time applications (Q436214) (← links)
• CPMD-mindful task assignment for NPS-F (Q488221) (← links)
• Unified overhead-aware schedulability analysis for slot-based task-splitting (Q488236) (← links)
• Cluster scheduling for real-time systems: utilization bounds and run-time overhead (Q554016) (← links)
• Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound (Q656084) (← links)
• Optimal virtual cluster-based multiprocessor scheduling (Q1039304) (← links)
• Priority-free conditionally-preemptive scheduling of modular sporadic real-time systems (Q1640292) (← links)
• An optimal boundary fair scheduling (Q2251416) (← links)
• Real-time application mapping for many-cores using a limited migrative model (Q2356297) (← links)
• The maximum gain of increasing the number of preemptions in multiprocessor scheduling (Q2390934) (← links)
• Bounding the Power of Preemption in Randomized Scheduling (Q4210081) (← links)