# Scheduling with Communication Delay in Near-Linear Time

@inproceedings{Liu2021SchedulingWC,
title={Scheduling with Communication Delay in Near-Linear Time},
author={Quanquan C. Liu and Manish Purohit and Zoya Svitkina and Erik Vee and Joshua R. Wang},
booktitle={Symposium on Theoretical Aspects of Computer Science},
year={2021}
}
• Published in
Symposium on Theoretical…
5 August 2021
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 ρ time units after u completes. The scheduling objective is to minimize makespan, i.e…
3 Citations

## Figures and Tables from this paper

• Computer Science
ArXiv
• 2022
The results represent the first polylogarithmic approximation algorithms for scheduling with non-uniform communication delays and include schedules which allow duplication of jobs as well as schedules which do not.
• Computer Science
• 2022
An approximation-preserving reduction from the Unique Machines Precedence-constrained Scheduling ( UMPS) problem is presented, and the best approximation for non-uniform delays is provided for the setting with uniform speeds, uniform sizes, and no job delays.
• Computer Science
ArXiv
• 2023
A detailed taxonomy of simpler scheduling models that can be understood as variants or special cases of BSP, and discuss the properties of the problem and the optimum cost in these models, and how they differ from BSP.

## References

SHOWING 1-10 OF 28 REFERENCES

2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
• 2020
This work considers the problem of scheduling precedence-constrained jobs on uniformly-related machines in the presence of an arbitrary, fixed communication delay and presents a polynomial time algorithm to transform any schedule to a schedule without duplication at the cost of an increase in makespan polylogarithmic in the number of jobs and machines.
• Computer Science
SODA
• 2020
It is shown that there exists a $(1+\epsilon)$-approximation algorithm (with similar running time) for the non-migratory setting: when every job has to be scheduled entirely on a single machine, but within a machine the job need not be scheduled during consecutive time steps.
A schedule is proposed which minimizes the makespan, the time when the last job is completed, and the constraints are that a job can only be scheduled after its release time, and preemption is not allowed.
• Computer Science
IEEE Trans. Parallel Distributed Syst.
• 1998
A Task Duplication based Scheduling (TDS) algorithm which can schedule directed acyclic graphs (DAGs) with a complexity of O(|V|/sup 2/), where |V| is the number of tasks in the DAG.