Creator:

Zhang, Fengxiang ; Zhai, Yanfeng ; Liao, Jianwei

Contributor:

Korbicz, Józef (1951- ) - red. ; Uciński, Dariusz - red.

Title:

A new sufficient schedulability analysis for hybrid scheduling

Group publication title:

AMCS, Volume 26 (2016)

Subject and Keywords:

scheduling algorithms ; real-time systems ; schedulability analysis ; preemptive scheduling ; earliest deadline first ; fixed priority

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.

Publisher:

Zielona Góra: Uniwersytet Zielonogórski

Resource Type:

artykuł

DOI:

10.1515/amcs-2016-0047

Pages:

683-692

Source:

AMCS, volume 26, number 3 (2016) ; click here to follow the link

Language:

eng

Rights:

Biblioteka Uniwersytetu Zielonogórskiego