Discrete load balancing on complete bipartite graphs

DOI10.1016/J.IPL.2021.106224OpenAlexW3213780618MaRDI QIDQ2059905FDOQ2059905

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

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

zbMATH Keywords

distributed computingbipartite graphload balancing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

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

Cited In (4)

• Semi-matchings for bipartite graphs and load balancing
• Title not available (Why is that?)
• Load balancing for Markov chains with a specified directed graph
• 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)