Faculty Recruiting Support CICS

Theory Seminar - Scheduling with Communication Delay in Near-Linear Time

12 Oct
Tuesday, 10/12/2021 4:00pm to 5:00pm
Computer Science Building, Room 140
Theory Seminar

Abstract: We consider the problem of efficiently scheduling jobs with precedence constraints on a set of identical machines in the presence of a uniform communication delay. Such precedence-constrained jobs can be modeled as a directed acyclic graph, G = (V, E). In this setting, if two precedence-constrained jobs u and v, with v dependent on u (u < v), are scheduled on different machines, then v must start at least \rho time units after u completes. The scheduling objective is to minimize makespan, i.e. the total time from when the first job starts to when the last job finishes. The focus of this chapter is to provide an efficient approximation algorithm with near-linear running time. We build on the algorithm of Lepere and Rapine [STACS 2002] for this problem to give an O(\frac{\ln \rho}{\ln \ln \rho})$ approximation algorithm that runs in ~O(|V| + |E|) time.

Joint work with Manish Purohit, Zoya Svitkina, Erik Vee and Joshua R. Wang.

The CICS Theory Seminar is free and open to the public. If you are interested in giving a talk, please email Cameron Musco or Rik Sengupta. Note that in addition to being a public lecture series, this is also a one-credit graduate seminar (CompSci 891M) that can be taken repeatedly for credit.