Discrete load balancing on complete bipartite graphs

DOI10.1016/J.IPL.2021.106224MaRDI QIDQ2059905zbMATH OpenOpenAlexFDO

Authors Xiao-Min Huang, Chenhao Wang

Publication date 14 December 2021

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2021.106224

zbMATH Keywords

distributed computingbipartite graphload balancing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Discrete load balancing is (almost) as easy as continuous load balancing
• Perfectly balanced allocation
• Quasirandom load balancing
• scientific article; zbMATH DE number 1263231
• Quasirandom load balancing

Cites work

• Dynamic load balancing by random matchings
• First- and second-order diffusive methods for rapid, coarse, distributed load balancing
• Longest distance of a non-uniform dispersion process on the infinite line
• Near-perfect load balancing by randomized rounding
• Randomized diffusion for indivisible loads
• Some remarks on the stable matching problem

Cited in

(5)

• Semi-matchings for bipartite graphs and load balancing
• scientific article; zbMATH DE number 975375 (Why is no real title available?)
• Load balancing for Markov chains with a specified directed graph
• Dynamic averaging load balancing on cycles
• Gracefulness of vertex duplicated complete bipartite graph for static and incremental frequency allocation

This page was built for publication: Discrete load balancing on complete bipartite graphs

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