University of Cambridge > Talks.cam > Computer Laboratory Systems Research Group Seminar > Omega: flexible, scalable schedulers for large compute clusters

Omega: flexible, scalable schedulers for large compute clusters

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Eiko Yoneki.

Increasing scale and the need for rapid response to changing requirements are hard to meet with current monolithic cluster scheduler architectures. This restricts the rate at which new features can be deployed, decreases efficiency and utilization, and will eventually limit cluster growth. In this talk, I will present a novel approach to address these needs using parallelism, shared state, and lock-free optimistic concurrency control. I will compare this approach to existing cluster scheduler designs, evaluate how much interference between schedulers occurs and how much it matters in practice, present some techniques to alleviate it, and finally discuss a use case highlighting the advantages of the shared-state approach – all driven by real-life Google production workloads.

Note that this is a practice talk on the EuroSys 2013 paper on my work done while interning at Google in 2011/12.

This talk is part of the Computer Laboratory Systems Research Group Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2020 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity