Aperiodic task scheduling for Hard-Real-Time systems
Aperiodic task scheduling for Hard-Real-Time systems
复制标题
DOI：
10.1007/bf02341920
复制
发表时间：
2006
影响因子：
1.3
通讯作者：
B. Sprunt;L. Sha;J. Lehoczky
中科院分区：
文献类型：
--
作者：
B. Sprunt;L. Sha;J. Lehoczky
实时系统由非周期性任务和周期性任务组成。周期性任务有固定的到达时间和严格的截止日期。非周期性任务的到达时间不规则，并且有软期限或硬期限。在本文中，我们提出了一种新算法，即 Sporadic Server 算法，该算法极大地提高了软截止时间非周期性任务的响应时间，并且可以保证周期性任务和非周期性任务的硬截止时间。讨论了零星服务器算法的操作、性能和可调度性分析，并与之前发布的非周期性服务算法进行了比较。
A real-time system consists of both aperiodic and periodic tasks. Periodic tasks have regular arrival times and hard deadlines. Aperiodic tasks have irregular arrival times and either soft or hard deadlines. In this article, we present a new algorithm, the Sporadic Server algorithm, which greatly improves response times for soft deadline aperiodic tasks and can guarantee hard deadlines for both periodic and aperiodic tasks. The operation of the Sporadic Server algorithm, its performance, and schedulability analysis are discussed and compared with previously published aperiodic service algorithms.