License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2022.47
URN: urn:nbn:de:0030-drops-158570
URL: https://drops.dagstuhl.de/opus/volltexte/2022/15857/
Go to the corresponding LIPIcs Volume Portal


Liu, Quanquan C. ; Purohit, Manish ; Svitkina, Zoya ; Vee, Erik ; Wang, Joshua R.

Scheduling with Communication Delay in Near-Linear Time

pdf-format:
LIPIcs-STACS-2022-47.pdf (1.0 MB)


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 ρ 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 paper 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((ln ρ)/(ln ln ρ))-approximation algorithm that runs in Õ(|V|+|E|) time.

BibTeX - Entry

@InProceedings{liu_et_al:LIPIcs.STACS.2022.47,
  author =	{Liu, Quanquan C. and Purohit, Manish and Svitkina, Zoya and Vee, Erik and Wang, Joshua R.},
  title =	{{Scheduling with Communication Delay in Near-Linear Time}},
  booktitle =	{39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)},
  pages =	{47:1--47:23},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-222-8},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{219},
  editor =	{Berenbrink, Petra and Monmege, Benjamin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2022/15857},
  URN =		{urn:nbn:de:0030-drops-158570},
  doi =		{10.4230/LIPIcs.STACS.2022.47},
  annote =	{Keywords: near-linear time scheduling, scheduling with duplication, precedence-constrained jobs, graph algorithms}
}

Keywords: near-linear time scheduling, scheduling with duplication, precedence-constrained jobs, graph algorithms
Collection: 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
Issue Date: 2022
Date of publication: 09.03.2022


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI