International Symposium on Distributed Computing

Distributed Computing pp 544-558

Locally Optimal Load Balancing

Conference paper

DOI: 10.1007/978-3-662-48653-5_36

Volume 9363 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Feuilloley L., Hirvonen J., Suomela J. (2015) Locally Optimal Load Balancing. In: Moses Y. (eds) Distributed Computing. Lecture Notes in Computer Science, vol 9363. Springer, Berlin, Heidelberg

Abstract

This work studies distributed algorithms for locally optimal load-balancing: We are given a graph of maximum degree \(\varDelta \), and each node has up to L units of load. The task is to distribute the load more evenly so that the loads of adjacent nodes differ by at most 1. If the graph is a path (\(\varDelta = 2\)), it is easy to solve the fractional version of the problem in O(L) communication rounds, independently of the number of nodes. We show that this is tight, and we show that it is possible to solve also the discrete version of the problem in O(L) rounds in paths. For the general case (\(\varDelta > 2\)), we show that fractional load balancing can be solved in \({{\mathrm{poly}}}(L,\varDelta )\) rounds and discrete load balancing in \(f(L,\varDelta )\) rounds for some function f, independently of the number of nodes.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Laurent Feuilloley
    • 1
    • 2
  • Juho Hirvonen
    • 2
  • Jukka Suomela
    • 2
  1. 1.École Normale Supérieure de CachanCachanFrance
  2. 2.Helsinki Institute for Information Technology HIIT, Department of Computer ScienceAalto UniversityEspooFinland