On the Performance Impact of Fair Share Scheduling.

Ethan D. Bolker, Yiping Ding · 2000

Fair share scheduling is a way to guarantee application performance by explicitly allocating shares of system resources among competing workloads. HP, IBM and Sun each offer a fair share scheduling package on their UNIX platforms. In this paper we construct a simple model of the semantics of CPU allocation for transaction workloads and report on some experiments that show that the model captures the behavior of each of the three implementations. Both the model and the supporting data illustrate some surprising conclusions that should help administrators to use these tools wisely. 1.

Read the paper · More papers on PaperTik