LP Hierarchies Approach for Scheduling Jobs With Dependencies
Motivated by applications in scheduling ML and data center workloads, we study scheduling jobs with dependencies. We revisit classic problems in this space, and develop new algorithmic frameworks based on linear and convex programming hierarchies. I will talk about some representative results that resolved well known open problems.
This talk is based on joint works with Shi Li, Jakub Tarnawski, Thomas Rothvoss, Sami Davies, and Yihao Zhang.