文章基本信息

标题：A new sufficient schedulability analysis for hybrid scheduling
作者：Fengxiang Zhang ; Yanfeng Zhai ; Jianwei Liao 等
期刊名称：International Journal of Applied Mathematics and Computer Science
电子版ISSN：2083-8492
出版年度：2016
卷号：26
期号：3
DOI：10.1515/amcs-2016-0047
出版社：De Gruyter Open
摘要：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
关键词：scheduling algorithms; real-time systems; schedulability analysis; preemptive scheduling; earliest deadline first; fixed priority