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 combining the EDF and FP strategies in one system. We provide a new sufficient schedulability analysis for real-time hybrid task systems whi...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2016-09-01
|
| Series: | International Journal of Applied Mathematics and Computer Science |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/amcs-2016-0047 |
| _version_ | 1818736780855214080 |
|---|---|
| author | Zhang Fengxiang Zhai Yanfeng Liao Jianwei |
| author_facet | Zhang Fengxiang Zhai Yanfeng Liao Jianwei |
| author_sort | Zhang Fengxiang |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-18T00:42:36Z |
| format | Article |
| id | doaj.art-fb6aa629ae9e439d949ebfadfeba4340 |
| institution | Directory Open Access Journal |
| issn | 2083-8492 |
| language | English |
| last_indexed | 2024-12-18T00:42:36Z |
| publishDate | 2016-09-01 |
| publisher | Sciendo |
| record_format | Article |
| series | International Journal of Applied Mathematics and Computer Science |
| spelling | doaj.art-fb6aa629ae9e439d949ebfadfeba43402022-12-21T21:26:50ZengSciendoInternational Journal of Applied Mathematics and Computer Science2083-84922016-09-0126368369210.1515/amcs-2016-0047amcs-2016-0047A new sufficient schedulability analysis for hybrid schedulingZhang Fengxiang0Zhai Yanfeng1Liao Jianwei2School of Computer and Information Science, Southwest University, Beibei District, Chongqing, ChinaSchool of Computer and Information Science, Southwest University, Beibei District, Chongqing, ChinaSchool of Computer and Information Science, Southwest University, Beibei District, Chongqing, ChinaEarliest 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.https://doi.org/10.1515/amcs-2016-0047scheduling algorithmsreal-time systemsschedulability analysispreemptive schedulingearliest deadline firstfixed priority |
| spellingShingle | Zhang Fengxiang Zhai Yanfeng Liao Jianwei A new sufficient schedulability analysis for hybrid scheduling International Journal of Applied Mathematics and Computer Science scheduling algorithms real-time systems schedulability analysis preemptive scheduling earliest deadline first fixed priority |
| title | A new sufficient schedulability analysis for hybrid scheduling |
| title_full | A new sufficient schedulability analysis for hybrid scheduling |
| title_fullStr | A new sufficient schedulability analysis for hybrid scheduling |
| title_full_unstemmed | A new sufficient schedulability analysis for hybrid scheduling |
| title_short | A new sufficient schedulability analysis for hybrid scheduling |
| title_sort | new sufficient schedulability analysis for hybrid scheduling |
| topic | scheduling algorithms real-time systems schedulability analysis preemptive scheduling earliest deadline first fixed priority |
| url | https://doi.org/10.1515/amcs-2016-0047 |
| work_keys_str_mv | AT zhangfengxiang anewsufficientschedulabilityanalysisforhybridscheduling AT zhaiyanfeng anewsufficientschedulabilityanalysisforhybridscheduling AT liaojianwei anewsufficientschedulabilityanalysisforhybridscheduling AT zhangfengxiang newsufficientschedulabilityanalysisforhybridscheduling AT zhaiyanfeng newsufficientschedulabilityanalysisforhybridscheduling AT liaojianwei newsufficientschedulabilityanalysisforhybridscheduling |