Early-release fair scheduling

  • Authors:
  • James H. Anderson;Anand Srinivasan

  • Affiliations:
  • Department of Computer Science, University of North Carolina, Chapel Hill, NC;Department of Computer Science, University of North Carolina, Chapel Hill, NC

  • Venue:
  • Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a variant of Pfair scheduling, which we call early-release fair (ERfair) scheduling. Like conventional Pfair scheduling, ERfair scheduling algorithms can be applied to optimally schedule periodic tasks on a multiprocessor system in polynomial time. However, ERfair scheduling differs from Pfair scheduling in that it is work conserving. As a result, average job response times may be much lower under ERfair scheduling than under Pfair scheduling, particularly in lightly-loaded systems. In addition, runtime costs are lower under ERfair scheduling.