Optimal rate-based scheduling on multiprocessors

作者：

Highlights：

•

摘要

The PD2 Pfair/ERfair scheduling algorithm is the most efficient known algorithm for optimally scheduling periodic tasks on multiprocessors. In this paper, we prove that PD2 is also optimal for scheduling “rate-based” tasks whose processing steps may be highly jittered. The rate-based task model we consider generalizes the widely-studied sporadic task model.

论文关键词：Fairness,Multiprocessors,Optimality,Pfair,Real time,Scheduling

论文评审过程：Received 15 December 2004, Revised 27 February 2006, Available online 17 April 2006.

论文官网地址：https://doi.org/10.1016/j.jcss.2006.03.001