Abstract
In this paper, we describe an extension of the Linux kernel scheduler called the Practical Fair-Share Scheduler (PFS). PFS is a fair-share process scheduler designed to support real-time workloads with soft (i.e., elastic) timeliness requirements. Fair-share scheduling is a common choice for soft real-time systems since it is work conserving and ensures a minimum CPU allocation for each process. A novel aspect of PFS is its treatment of placement and migration in SMP or multi-core settings. Other fair-share schedulers have used ad hoc policies for handling these issues, often leading to underutilization and increased system lag. In contrast, PFS uses a strategy that maintains utilization without unfairly penalizing processes. We spend the remainder of this paper discussing placement and migration. A more extensive description of PFS, including source code, can be found at the download site listed in the citations.
- Chandra, A., Adler, M., Goyal, P., and Shenoy, P. Surplus fair scheduling: a proportional-share cpu scheduling algorithm for symmetric multiprocessors. In OSDI'00: Proceedings of the 4th conference on Symposium on Operating System Design & Implementation (Berkeley, CA, USA, 2000), USENIX Association, pp. 4--4. Google Scholar
Digital Library
- Karlsson, M., Karamanolis, C., and Chase, J. Controllable fair queuing for meeting performance goals. Perform. Eval. 62, 1--4 (2005), 278--294. Google Scholar
Digital Library
Index Terms
Migration policies for multi-core fair-share scheduling
Recommendations
Early-release fair scheduling
Euromicro-RTS'00: Proceedings of the 12th Euromicro conference on Real-time systemsWe 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 ...
Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling
In prior work on soft real-time (SRT) multiprocessor scheduling, tardiness bounds have been derived for a variety of scheduling algorithms, most notably, the global earliest-deadline-first (G-EDF) algorithm. In this paper, we devise G-EDF-like (GEL) ...
Surplus fair scheduling: a proportional-share CPU scheduling algorithm for symmetric multiprocessors
OSDI'00: Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4In this paper, we present surplus fair scheduling (SFS), a proportional-share CPU scheduler designed for symmetric multiprocessors. We first show that the infeasibility of certain weight assignments in multiprocessor environments results in unfairness ...






Comments