On priority assignment in fixed priority scheduling
From MaRDI portal
Cites work
- 802.4 rate monotonic scheduling in hard real-time environments: setting the medium access control parameters
- A note on preemptive scheduling of periodic, real-time tasks
- Fixed priority scheduling with limited priority levels
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- On the complexity of fixed-priority scheduling of periodic, real-time tasks
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Cited in
(23)- Exact scheduling analysis of non-accumulatively monotonic multiframe tasks
- A specification-oriented semantics for the refinement of real-time systems
- An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems
- Exact speedup factors and sub-optimality for non-preemptive scheduling
- FPSL, FPCL and FPZL schedulability analysis
- Schedulability analysis for controller area network (CAN) with FIFO queues priority queues and gateways
- Bounding and shaping the demand of generalized mixed-criticality sporadic task systems
- Interference-aware fixed-priority schedulability analysis on multiprocessors
- Fault-tolerant and real-time scheduling for mixed-criticality systems
- On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm
- Generalizing fixed-priority scheduling for better schedulability in mixed-criticality systems
- Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling
- Maintaining the feasibility of hard real-time systems with a reduced number of priority levels
- Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms
- scientific article; zbMATH DE number 7559342 (Why is no real title available?)
- Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
- Design optimization for real-time systems with sustainable schedulability analysis
- Worst case response time analysis for completely fair scheduling in Linux systems
- FFOB: efficient online mode-switch procrastination in mixed-criticality systems
- The concept of maximal unschedulable deadline assignment for optimization in fixed-priority scheduled real-time systems
- Robust priority assignment for messages on Controller Area network (CAN)
- Optimal priority assignment in the presence of blocking
- Lowest priority first based feasibility analysis of real-time systems
This page was built for publication: On priority assignment in fixed priority scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603434)
