License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2019.63
URN: urn:nbn:de:0030-drops-106394
URL: http://drops.dagstuhl.de/opus/volltexte/2019/10639/
Go to the corresponding LIPIcs Volume Portal


Garg, Naveen ; Gupta, Anupam ; Kumar, Amit ; Singla, Sahil

Non-Clairvoyant Precedence Constrained Scheduling

pdf-format:
LIPIcs-ICALP-2019-63.pdf (0.5 MB)


Abstract

We consider the online problem of scheduling jobs on identical machines, where jobs have precedence constraints. We are interested in the demanding setting where the jobs sizes are not known up-front, but are revealed only upon completion (the non-clairvoyant setting). Such precedence-constrained scheduling problems routinely arise in map-reduce and large-scale optimization. For minimizing the total weighted completion time, we give a constant-competitive algorithm. And for total weighted flow-time, we give an O(1/epsilon^2)-competitive algorithm under (1+epsilon)-speed augmentation and a natural "no-surprises" assumption on release dates of jobs (which we show is necessary in this context). Our algorithm proceeds by assigning virtual rates to all waiting jobs, including the ones which are dependent on other uncompleted jobs. We then use these virtual rates to decide on the actual rates of minimal jobs (i.e., jobs which do not have dependencies and hence are eligible to run). Interestingly, the virtual rates are obtained by allocating time in a fair manner, using a Eisenberg-Gale-type convex program (which we can solve optimally using a primal-dual scheme). The optimality condition of this convex program allows us to show dual-fitting proofs more easily, without having to guess and hand-craft the duals. This idea of using fair virtual rates may have broader applicability in scheduling problems.

BibTeX - Entry

@InProceedings{garg_et_al:LIPIcs:2019:10639,
  author =	{Naveen Garg and Anupam Gupta and Amit Kumar and Sahil Singla},
  title =	{{Non-Clairvoyant Precedence Constrained Scheduling}},
  booktitle =	{46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
  pages =	{63:1--63:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-109-2},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{132},
  editor =	{Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10639},
  URN =		{urn:nbn:de:0030-drops-106394},
  doi =		{10.4230/LIPIcs.ICALP.2019.63},
  annote =	{Keywords: Online algorithms, Scheduling, Primal-Dual analysis, Nash welfare}
}

Keywords: Online algorithms, Scheduling, Primal-Dual analysis, Nash welfare
Seminar: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Issue Date: 2019
Date of publication: 08.07.2019


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