Uncovering CPU load balancing policies with harmony

  • Authors:
  • Joseph T. Meehean;Andrea C. Arpaci-Dusseau;Remzi H. Arpaci-Dusseau;Miron Livny

  • Affiliations:
  • Lynchburg College;University of Wisconsin;University of Wisconsin;University of Wisconsin

  • Venue:
  • Proceedings of the ACM International Conference on Computing Frontiers
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce Harmony, a system for extracting the multiprocessor scheduling policies from commodity operating systems. Harmony can be used to unearth many aspects of multiprocessor scheduling policy, including the nuanced behaviors of core scheduling mechanisms and policies. We demonstrate the effectiveness of Harmony by applying it to the analysis of the load-balancing behavior of three Linux schedulers: O(1), CFS, and BFS. Our analysis uncovers the strengths and weaknesses of each of these schedulers, and more generally shows how to utilize Harmony to perform detailed analyses of complex scheduling systems.