Online load balancing with general reassignment cost

Sebastian Berndt, Franziska Eberle and Nicole Megow

LSE Research Online Documents on Economics from London School of Economics and Political Science, LSE Library

Abstract: We investigate a semi-online variant of load balancing with restricted assignment. In this problem, we are given n jobs, which need to be processed by m machines with the goal to minimize the maximum machine load. Since strong lower bounds rule out any competitive ratio of o(log⁡n), we may reassign jobs at a certain job-individual cost. We generalize a result by Gupta, Kumar, and Stein (SODA 2014) by giving a O(log⁡log⁡mn)-competitive algorithm with constant amortized reassignment cost.

Keywords: competitive analysis; migration; online load balancing; recourse (search for similar items in EconPapers)
JEL-codes: J01 R14 (search for similar items in EconPapers)
Pages: 7 pages
Date: 2022-05-01
References: View references in EconPapers View complete reference list from CitEc
Citations:

Published in Operations Research Letters, 1, May, 2022, 50(3), pp. 322 - 328. ISSN: 0167-6377

Downloads: (external link)
http://eprints.lse.ac.uk/114914/ Open access version. (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ehl:lserod:114914

Access Statistics for this paper

More papers in LSE Research Online Documents on Economics from London School of Economics and Political Science, LSE Library LSE Library Portugal Street London, WC2A 2HD, U.K.. Contact information at EDIRC.
Bibliographic data for series maintained by LSERO Manager (lseresearchonline@lse.ac.uk).