Pages that link to "Item:Q692625"
From MaRDI portal
The following pages link to Feasibility analysis of sporadic real-time multiprocessor task systems (Q692625):
Displaying 11 items.
- On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm (Q255296) (← links)
- 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)
- An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems (Q1698775) (← links)
- Automated competitive analysis of real-time scheduling with graph games (Q1698779) (← links)
- Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm (Q2251369) (← links)
- Synthesising succinct strategies in safety games with an application to real-time scheduling (Q2636511) (← links)
- (Q3586399) (redirect page) (← links)
- (Q5089127) (← links)
- (Q5140792) (← links)
- Approximation algorithms for replenishment problems with fixed turnover times (Q5918783) (← links)
