An Optimal Boundary-Fair Scheduling Algorithm for Multiprocessor Real-Time Systems

Free registration required

Executive Summary

Although the scheduling problem for multiprocessor real-time systems has been studied for decades, it is still an evolving research field with many open problems. In this paper, focusing on periodic real-time tasks, the authors propose a novel optimal scheduling algorithm, namely Boundary fair (Bfair), which follows the same line of research as the well-known Pfair scheduling algorithms and can also achieve full system utilization. However, different from the Pfair algorithms that make scheduling decisions at every time unit to enforce proportional progress (i.e., fairness) for each task, Bfair makes scheduling decisions and enforces fairness to tasks only at tasks' period boundaries.

  • Format: PDF
  • Size: 287.4 KB