J4

• 研究论文 • 上一篇    下一篇

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

张惠娟;周水生;周利华   

  1. (西安电子科技大学 多媒体技术研究所, 陕西 西安 710071)

  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2004-04-20 发布日期:2004-04-20

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

ZHANG Hui-juan;ZHOU Shui-sheng;ZHOU Li-hua

  

  1. (Research Inst. of Multimedia Technology, Xidian Univ., Xi'an 710071, China)
  • Received:1900-01-01 Revised:1900-01-01 Online:2004-04-20 Published:2004-04-20

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

关键词: 多处理器系统, PFair公平调度, 混合实时任务, 最坏响应时间

Abstract: 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. PD2 has been developed recently and is the most efficient. But in practice, the real-time tasks are made up of period and apordic taks. 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.

Key words: multiprocessor systems, PFair, apordic and period task, worse-case response time

中图分类号: 

  • TP316.2