一种混合实时任务系统的公平调度算法

Baruah提出的PFair公平调度理论是周期任务在多处理器系统上的最佳实时调度理论，而在实际实时系统中，实时任务往往是由周期任务和非周期任务组成的混合任务系统．在研究PFair公平调度理论和算法的基础上，提出了基于服务器思想的公平调度方案，使得PFair调度理论适用于多处理器系统中混合任务的实时调度，并提出了对非周期任务进行实时调度的3种策略，给出软实时性非周期任务在不同调度策略下的最坏响应时间计算公式，并且证明了计算公式．

A fair-scheduling algorithm for apordic and period tasks on multiprocessor systems

The fair scheduling theory is an important scheduling theory for period tasks on multiprocessor systems. PFair scheduling, proposed by Baruah, is presently the only known optimal scheduling method for period real-time tasks on multiprocessor systems. PD~2 has been developed recently and is the most efficient. But in practice, the real-time tasks are made up of period and apordic tasks. In this paper, based on the fair scheduling theory and algorithms, a fair scheduling algorithm based on the server is proposed for apordic and period tasks on real-time multiprocessor systems. Three scheduling ways for apordic tasks are presented. The worst-case response time for the soft apordic real-time task is also computed, with the computed expressions proved.