Dynamic averaging load balancing on cycles

DOI10.1007/S00453-021-00905-9MaRDI QIDQ2118388zbMATH OpenOpenAlexFDO

Authors Dan Alistarh, Giorgi Nadiradze, Amirmojtaba Sabour

Publication date 22 March 2022

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00453-021-00905-9

zbMATH Keywords

algorithmsload balancing

Mathematics Subject Classification ID

Graph theory (05Cxx) Algorithms in computer science (68Wxx)

Recommendations

• Randomized load balancing on networks with stochastic inputs
• Discrete load balancing on complete bipartite graphs
• Graphical balanced allocations and the (1+ )-choice process
• scientific article; zbMATH DE number 1263231
• Tight Analyses of Two Local Load Balancing Algorithms

Cites work

• An Analysis of Random-Walk Cuckoo Hashing
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Balanced Allocations
• Balanced allocations: a simple proof for the heavily loaded case
• Balanced allocations: the heavily loaded case
• Dynamic load balancing by random matchings
• 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 5454133 (Why is no real title available?)
• scientific article; zbMATH DE number 1263231 (Why is no real title available?)
• scientific article; zbMATH DE number 1301967 (Why is no real title available?)
• scientific article; zbMATH DE number 1857645 (Why is no real title available?)
• Randomized allocation processes
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• The power of choice in priority scheduling

Cited in

(1)

• Periodic load balancing

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 Q2118388)