Association for Computing Machinery
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. The authors present a novel approach to address these needs using parallelism, shared state, and lock-free optimistic concurrency control. They 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 their approach - all driven by real-life Google production workloads.