On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm
From MaRDI portal
(Redirected from Publication:255296)
Recommendations
- Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
- An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems
- Interference-aware fixed-priority schedulability analysis on multiprocessors
- An analysis of fixed-priority schedulability on a multiprocessor
- Fixed priority scheduling with limited priority levels
Cites work
- A survey of hard real-time scheduling for multiprocessor systems
- Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
- Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
- On priority assignment in fixed priority scheduling
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Cited in
(3)- Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
- A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling
- An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems
This page was built for publication: On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q255296)
