Pages that link to "Item:Q5386255"
From MaRDI portal
The following pages link to Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks (Q5386255):
Displaying 13 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)
- Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms (Q332516) (← links)
- Feasibility analysis of sporadic real-time multiprocessor task systems (Q692625) (← links)
- EDZL scheduling analysis (Q842727) (← links)
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible (Q987535) (← links)
- Improved multiprocessor global schedulability analysis (Q993508) (← links)
- On the ineffectiveness of \(1/m\)-based interference bounds in the analysis of global EDF and FIFO scheduling (Q1616839) (← 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)
- (Q5089127) (← links)
- Push forward: global fixed-priority scheduling of arbitrary-deadline sporadic task systems (Q5140791) (← links)
- A response-time analysis for non-preemptive job sets under global scheduling (Q5140792) (← links)
