Speakers
Barret Rhoden
(Google)
Josh Don
(Google)
Description
This is meant to be a look at some of the BPF based policies we've developed that are currently running (or will soon be running), large chunks of Google's infrastructure. The focus of the talk will be on some of the scheduling design choices, how they differ from CFS, and what we've learned along the way. Meant to be fairly interactive and invite audience participation regarding what changes these may inspire for CFS or other pluggable schedulers. For example, one key tradeoff we've been able to make is to represent scheduling entities more strongly at the group level, rather than treat everything as independent threads (which CFS must do). This gives better grouping properties for keeping jobs constrained on shared server environment.
Co-authors
Barret Rhoden
(Google)
Josh Don
(Google)