On priority assignment in fixed priority scheduling
From MaRDI portal
Publication:1603434
DOI10.1016/S0020-0190(00)00165-4zbMath0998.68018MaRDI QIDQ1603434
Publication date: 14 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
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, Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor 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, Exact scheduling analysis of non-accumulatively monotonic multiframe tasks, A specification-oriented semantics for the refinement of real-time systems, 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
Uses Software
Cites Work
- Unnamed Item
- 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
- On the complexity of fixed-priority scheduling of periodic, real-time tasks
- Fixed priority scheduling with limited priority levels
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
