An Approximate Analysis of a UNIX Macro Process Scheduler
INFORMS Journal on Computing · 1998 · Volume 10 · Issue 3
Abstract
A UNIX macro process scheduler, referred to as the Fair Share Scheduler (FSS), is a UNIX scheduling algorithm that allocates different shares of the processor capacity to different groups of processes. First, the scheduling algorithm is approximated by a generalized processor-sharing discipline. Then, a second approximation is made to derive the mean response times of the different groups and the optimal allocation of shares among the groups. Finally, an application is shown where substantial performance improvements are observed.
Keywords
Unix scheduler analysis, CPU scheduling, mean response times, throughput, optimal share allocation, generalized processor-sharing discipline
Enable JavaScript for citation tools and additional paper interactions.