Schedulability analysis of non-preemptive strictly periodic tasks in multi-core real-time systems
From MaRDI portal
Publication:283171
DOI10.1007/S11241-015-9226-ZzbMath1357.68019OpenAlexW2094589562MaRDI QIDQ283171
Chenglie Du, Fei Xie, Zhenkun Yang, Jinchao Chen
Publication date: 13 May 2016
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11241-015-9226-z
schedulability analysismulti-core systemmulti-task schedulingnon-preemptive schedulingstrictly periodic task
Uses Software
Cites Work
- Line search method for solving a non-preemptive strictly periodic scheduling problem
- Strictly periodic scheduling in IMA-based architectures
- Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
- Measuring the performance of schedulability tests
- The non-preemptive scheduling of periodic tasks upon multiprocessors
- Scheduling of offset free systems
- Priority-driven scheduling of periodic task systems on multiprocessors
- Symmetry Breaking for Multi-criteria Mapping and Scheduling on Multicores
- Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods
- Scheduling Periodic Tasks in a Hard Real-Time Environment
- A Theory of Exit in Duopoly
- Pre-emptive versus non-pre-emptive real time scheduling in intelligent mobile robotics
This page was built for publication: Schedulability analysis of non-preemptive strictly periodic tasks in multi-core real-time systems