Push forward: global fixed-priority scheduling of arbitrary-deadline sporadic task systems
From MaRDI portal
Publication:5140791
DOI10.4230/LIPICS.ECRTS.2018.8zbMATH Open1497.68059arXiv1802.10376MaRDI QIDQ5140791FDOQ5140791
Authors: Jian-Jia Chen, Georg von der Brüggen, Niklas Ueter 
Publication date: 16 December 2020
Full work available at URL: https://arxiv.org/abs/1802.10376
Recommendations
- An analysis of global \texttt{EDF} schedulability for arbitrary-deadline sporadic task systems
- An analysis of fixed-priority schedulability on a multiprocessor
- A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling
- Schedulability analysis of global EDF
- Interference-aware fixed-priority schedulability analysis on multiprocessors
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
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Measuring the performance of schedulability tests
- Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm
- A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling
- Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems
- An analysis of fixed-priority schedulability on a multiprocessor
- A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines
- EDF-schedulability of synchronous periodic task systems is coNP-hard
- Improved multiprocessor global schedulability analysis
- Algorithms and complexity for periodic real-time scheduling
- On the pitfalls of resource augmentation factors and utilization bounds in real-time scheduling
Cited In (9)
- Schedulability analysis of global EDF
- A response-time analysis for non-preemptive job sets under global scheduling
- Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems
- Multiprocessor real-time scheduling with arbitrary processor affinities: from practice to theory
- An analysis of fixed-priority schedulability on a multiprocessor
- Guaranteeing response times for aperiodic tasks in global multiprocessor scheduling
- Interference-aware fixed-priority schedulability analysis on multiprocessors
- Schedulability analysis of DAG tasks with arbitrary deadlines under global fixed-priority scheduling
- Improved multiprocessor global schedulability analysis
This page was built for publication: Push forward: global fixed-priority scheduling of arbitrary-deadline sporadic task systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140791)
