Pages that link to "Item:Q987535"
From MaRDI portal
The following pages link to Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible (Q987535):
Displaying 10 items.
- {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling (Q436211) (← links)
- Multiprocessor real-time scheduling with arbitrary processor affinities: from practice to theory (Q495922) (← links)
- {\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines (Q613790) (← links)
- An optimal boundary fair scheduling algorithm for multiprocessor real-time systems (Q645817) (← links)
- Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound (Q656084) (← links)
- Feasibility analysis of sporadic real-time multiprocessor task systems (Q692625) (← links)
- Online and offline scheduling with cache-related preemption delays (Q1616848) (← links)
- Energy-efficient thermal-aware multiprocessor scheduling for real-time tasks using TCPN (Q2177760) (← links)
- Laxity dynamics and LLF schedulability analysis on multiprocessor platforms (Q2251352) (← links)
- A constant-approximate feasibility test for multiprocessor real-time scheduling (Q2428689) (← links)
