Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
From MaRDI portal
Publication:617741
DOI10.1007/S11241-010-9106-5zbMath1206.68063OpenAlexW2018115912MaRDI QIDQ617741
Publication date: 13 January 2011
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11241-010-9106-5
Fixed priorityGlobal schedulingHeuristic priority assignmentMulticoreMultiprocessorOptimal priority assignmentReal-timeSchedulability analysisTaskset generation
Related Items (18)
On the ineffectiveness of \(1/m\)-based interference bounds in the analysis of global EDF and FIFO scheduling ⋮ An extensible framework for multicore response time analysis ⋮ An efficient schedulability analysis for optimizing systems with adaptive mixed-criticality scheduling ⋮ Schedulability analysis of non-preemptive strictly periodic tasks in multi-core real-time systems ⋮ Combinatorial abstraction refinement for feasibility analysis of static priorities ⋮ An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems ⋮ Partitioned EDF scheduling for multiprocessors using a \(C=D\) task splitting scheme ⋮ Multiprocessor real-time scheduling with arbitrary processor affinities: from practice to theory ⋮ Laxity dynamics and LLF schedulability analysis on multiprocessor platforms ⋮ FPSL, FPCL and FPZL schedulability analysis ⋮ Schedulability analysis for controller area network (CAN) with FIFO queues priority queues and gateways ⋮ Interference-aware fixed-priority schedulability analysis on multiprocessors ⋮ Fault-tolerant and real-time scheduling for mixed-criticality systems ⋮ Cluster scheduling for real-time systems: utilization bounds and run-time overhead ⋮ Scheduling algorithms to reduce the static energy consumption of real-time systems ⋮ The concept of maximal unschedulable deadline assignment for optimization in fixed-priority scheduled real-time systems ⋮ On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm ⋮ Architecture aware semi partitioned real-time scheduling on multicore platforms
Cites Work
- Measuring the performance of schedulability tests
- EDZL scheduling analysis
- An analysis of fixed-priority schedulability on a multiprocessor
- An analysis of global \texttt{EDF} schedulability for arbitrary-deadline sporadic task systems
- Priority-driven scheduling of periodic task systems on multiprocessors
- On priority assignment in fixed priority scheduling
- On the complexity of fixed-priority scheduling of periodic, real-time tasks
- On a Real-Time Scheduling Problem
- Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
This page was built for publication: Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
