The Share Scheduler Revisited

Abstract

The Fair Share Scheduler allocates computing resources between users,
independant of the number of processes. Succeeding versions have all
used the same algorithm, but implementation details have affected its
accuracy. Changes are described that affect process priority decay,
and group share adjustement.