Friday, April 23, 2021 – 3:30pm to 4:30pm
Virtual Presentation – ET Remote Access – Zoom
JANARDHAM KULKARNI, Senior Researchers https://www.microsoft.com/en-us/research/people/jakul/
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 made progress on long standing open problems.
This talk is based on several published papers with Shi Li, Jakub Tarnawski, Thomas Rothvoss, Sami Davies, Garg, Shashwat and Yihao Zhang.
Janardhan Kulkarni is a senior researcher in the Algorithms group, MSR Redmond. His research interests are in designing efficient algorithms for fundamental problems in resource allocation and scheduling theory. He has also studied algorithm design when data privacy is a concern, especially in the context of differential privacy for training (deep) language models.
Zoom Participation. See announcement.