Dynamic averaging load balancing on cycles

DOI10.4230/LIPICS.ICALP.2020.7MaRDI QIDQ6842573zbMATH OpenFDO

Authors Dan Alistarh, Giorgi Nadiradze, Amirmojtaba Sabour

Publication date 18 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2020.7

zbMATH Keywords

algorithmsload balancing

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• An Analysis of Random-Walk Cuckoo Hashing
• Balanced Allocations
• Balanced allocations: a simple proof for the heavily loaded case
• Balanced allocations: the heavily loaded case
• First- and second-order diffusive methods for rapid, coarse, distributed load balancing
• Graphical balanced allocations and the (1+ )-choice process
• scientific article; zbMATH DE number 1857645 (Why is no real title available?)
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• The power of choice in priority scheduling
• Tight bounds for randomized load balancing on arbitrary network topologies

This page was built for publication: Dynamic averaging load balancing on cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842573)