On the analysis of randomized load balancing schemes
From MaRDI portal
Publication:1293921
DOI10.1007/s002240000122zbMath0932.68003OpenAlexW1981657724MaRDI QIDQ1293921
Publication date: 23 September 1999
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002240000122
Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10) Mathematical problems of computer architecture (68M07)
Related Items (7)
On a doubly dynamically controlled supermarket model with impatient customers ⋮ The Power of Filling in Balanced Allocations ⋮ Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks ⋮ The mean-field computation in a supermarket model with server multiple vacations ⋮ Block-structured supermarket models ⋮ TAIL PROBABILITIES IN QUEUEING PROCESSES ⋮ Rate of relaxation for a mean-field zero-range process
This page was built for publication: On the analysis of randomized load balancing schemes
