Towards a Tractable Exact Test for Global Multiprocessor Fixed Priority Scheduling

Scheduling algorithms are called "global" if they can migrate tasks between cores. Global scheduling algorithms are the de-facto standard practice for general purpose Operating Systems, to balance the workload between cores. However, the exact schedulability analysis of real-time applicati...

Ausführliche Beschreibung