July 13th-16th, 2010
Ottawa Westin
Ottawa, Canada

Event Details Draft Schedule
Venue
Travel & Hotel
Costs

FAQ

Media
Archives
Contact

Home

Account

Summary

CPU bandwidth limits under CFS

CPU bandwidth limits under CFS

========================

Over the past few years there has been an increasing focus on the development of features for resource management within the Linux kernel. The addition of the fair group scheduler has enabled the provisioning of proportional CPU time through the specification of group weights. Since the scheduler is inherently work-conserving in nature, a task or a group can consume excess CPU share in an otherwise idle system. There are many scenarios where this extra CPU share can cause unacceptable utilization or latency. CPU bandwidth provisioning or limiting approaches this problem by providing an explicit upper bound on usage in addition to the lower bound already provided by shares.

There are many enterprise scenarios where this functionality is useful. In particular are the cases of pay-per-use environments, and latency provisioning within non-homogeneous environments.

This paper details the requirements behind this feature, the challenges involved in incorporating into CFS (Completely Fair Scheduler), and the future development road map for this feature.

Authors:

Bharata B Rao - bharata@linux.vnet.ibm.com

Paul Turner - pjt@google.com

Nikhil Rao - ncrao@google.com

register | account summary | call for papers

Copyright © 2010 Linux Symposium Inc. All rights reserved.
Linux is a registered trademark of Linus Torvalds.