<abstract xmlns="http://www.w3.org/1999/xhtml"><p>Earliest deadline first (EDF) and fixed priority (FP) are the most commonly used and studied scheduling algorithms for real-time systems. This paper focuses on combining the EDF and FP strategies in one system. We provide a new sufficient schedulability analysis for real-time hybrid task systems which are scheduled by EDF and FP. The proposed analysis has a polynomial time complexity and no restrictions on task parameters, where the relative deadline of each task could be less than, equal to, or greater than its period. By extensive experiments, we show that our proposed analysis significantly improves the acceptance ratio compared with the existing results of the sufficient schedulability test for hybrid scheduling systems.</p></abstract>

Earliest deadline first (EDF) and fixed priority (FP) are the most commonly used and studied scheduling algorithms for real-time systems. This paper focuses on combining the EDF and FP strategies in one system. We provide a new sufficient schedulability analysis for real-time hybrid task systems which are scheduled by EDF and FP. The proposed analysis has a polynomial time complexity and no restrictions on task parameters, where the relative deadline of each task could be less than, equal to, or greater than its period. By extensive experiments, we show that our proposed analysis significantly improves the acceptance ratio compared with the existing results of the sufficient schedulability test for hybrid scheduling systems.

A new sufficient schedulability analysis for hybrid scheduling

School of Computer and Information Science, Southwest University, Beibei District, Chongqing,

International Journal of Applied Mathematics and Computer Science

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

{"article-title":"A new sufficient schedulability analysis for hybrid scheduling"}

Earliest deadline first (EDF) and fixed priority (FP) are the most commonly used and studied scheduling algorithms for real-time systems. This paper focuses on...

A new sufficient schedulability analysis for hybrid scheduling

Pubblicato online: 29 set 2016

Pagine: 683 - 692

Ricevuto: 26 mag 2015

Accettato: 10 mar 2016

DOI: https://doi.org/10.1515/amcs-2016-0047

Parole chiave
scheduling algorithms, real-time systems, schedulability analysis, preemptive scheduling, earliest deadline first, fixed priority

© 2016 Fengxiang Zhang et al., published by De Gruyter Open

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

A new sufficient schedulability analysis for hybrid scheduling

Pubblicato online: 29 set 2016

Pagine: 683 - 692

Ricevuto: 26 mag 2015

Accettato: 10 mar 2016

DOI: https://doi.org/10.1515/amcs-2016-0047

Parole chiavescheduling algorithms, real-time systems, schedulability analysis, preemptive scheduling, earliest deadline first, fixed priority

© 2016 Fengxiang Zhang et al., published by De Gruyter Open

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Parole chiave
scheduling algorithms, real-time systems, schedulability analysis, preemptive scheduling, earliest deadline first, fixed priority