Dynamic load balancing by random matchings
From MaRDI portal
Publication:676439
DOI10.1006/jcss.1996.0075zbMath0864.68005OpenAlexW2060084491MaRDI QIDQ676439
Publication date: 9 June 1997
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/4d61a8e9952d1bea9dbb39554e3578c04df5fcd9
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer system organization (68M99)
Related Items
The move-to-partner rule for self-organizing task allocation on a linear array ⋮ Quantized consensus ⋮ Random allocation of jobs with weights and precedence ⋮ Fast discrete consensus based on gossip for makespan minimization in networked systems ⋮ The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs ⋮ Quantized consensus in Hamiltonian graphs ⋮ A simple approach for adapting continuous load balancing processes to discrete settings ⋮ On the stability of dynamic diffusion load balancing ⋮ Discrete load balancing on complete bipartite graphs ⋮ Adaptive packet routing for bursty adversarial traffic ⋮ Dynamic averaging load balancing on cycles
This page was built for publication: Dynamic load balancing by random matchings
