Pages that link to "Item:Q2251369"
From MaRDI portal
The following pages link to Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm (Q2251369):
Displaying 4 items.
- A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling (Q283177) (← links)
- On the ineffectiveness of \(1/m\)-based interference bounds in the analysis of global EDF and FIFO scheduling (Q1616839) (← links)
- Synthesising succinct strategies in safety games with an application to real-time scheduling (Q2636511) (← links)
- (Q5140791) (← links)
