- Tytuł:
- A new sufficient schedulability analysis for hybrid scheduling
- Autorzy:
-
Zhang, F.
Zhai, Y.
Liao, J. - Powiązania:
- https://bibliotekanauki.pl/articles/330353.pdf
- Data publikacji:
- 2016
- Wydawca:
- Uniwersytet Zielonogórski. Oficyna Wydawnicza
- Tematy:
-
scheduling algorithm
real time system
schedulability analysis
preemptive scheduling
earliest deadline first
fixed priority
algorytm szeregowania
system czasu rzeczywistego
analiza szeregowalności - Opis:
- 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.
- Źródło:
-
International Journal of Applied Mathematics and Computer Science; 2016, 26, 3; 683-692
1641-876X
2083-8492 - Pojawia się w:
- International Journal of Applied Mathematics and Computer Science
- Dostawca treści:
- Biblioteka Nauki
Artykuł