Fixed priority scheduling with limited priority levels
From MaRDI portal
Publication:4421189
Recommendations
- scientific article; zbMATH DE number 2112451
- An analysis of fixed-priority schedulability on a multiprocessor
- Uniprocessor static priority scheduling with limited priority levels
- A dynamic scheduling algorithm based on limited number of priority
- Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems
Cited in
(15)- On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm
- Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems
- On-line schedulability tests for adaptive reservations in fixed priority scheduling
- On priority assignment in fixed priority scheduling
- On fixed priority scheduling, offsets and co-prime task periods
- A dynamic scheduling algorithm based on limited number of priority
- A group priority earliest deadline first scheduling algorithm
- A dynamic scheduling grouping algorithm based on limited priority levels
- Uniprocessor static priority scheduling with limited priority levels
- scientific article; zbMATH DE number 2112451 (Why is no real title available?)
- Maintaining the feasibility of hard real-time systems with a reduced number of priority levels
- Conventional and early token release scheduling models for the IEEE 802.5 token ring
- Performance Analysis of Dynamic Priority Shifting
- Fixed-priority scheduling on prioritized SMT processor
- scientific article; zbMATH DE number 2080760 (Why is no real title available?)
This page was built for publication: Fixed priority scheduling with limited priority levels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4421189)