Dynamic load balancing by random matchings
From MaRDI portal
Recommendations
- Automata, Languages and Programming
- Random seeking: a general, efficient, and informed randomized scheme for dynamic load balancing
- Randomized load balancing by joining and splitting bins
- Quasirandom load balancing
- Quasirandom load balancing
- Near-perfect load balancing by randomized rounding
- Dynamic load balancing by diffusion in heterogeneous systems
Cited in
(18)- Dynamic load balancing for switch-based networks.
- A stochastic load balancing algorithm for i-Computing
- A simple approach for adapting continuous load balancing processes to discrete settings
- Dynamic averaging load balancing on cycles
- Fast discrete consensus based on gossip for makespan minimization in networked systems
- On the stability of dynamic diffusion load balancing
- Quantized consensus
- scientific article; zbMATH DE number 833724 (Why is no real title available?)
- Random allocation of jobs with weights and precedence
- The move-to-partner rule for self-organizing task allocation on a linear array
- Dynamic load balancing with flexible workers
- Dynamic load balancing with group communication
- Quantized consensus in Hamiltonian graphs
- scientific article; zbMATH DE number 1629981 (Why is no real title available?)
- Online and Random-order Load Balancing Simultaneously
- Discrete load balancing on complete bipartite graphs
- Adaptive packet routing for bursty adversarial traffic
- The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs
This page was built for publication: Dynamic load balancing by random matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676439)
