On Mon, 28 Jun 2010 11:08:13 -0500, Brian Granger wrote: > The current load balancing algorithm used by the XREQ socket is defined in > lb.cpp. Requests are simply round robin'ed through the active pipes: > [snip] > I am wondering if we can do better than this. My idea is to pick a client > at random, rather that walking through them sequentially.
Btw: http://berezecki.com/?p=22 I'm a big fan of randomization, however for "perfect" balancing (e.g. request/response time minimization) of jobs with large deviation you'll always need statistics or weights. Things only get more complicated from there. :) -h _______________________________________________ zeromq-dev mailing list zeromq-dev@lists.zeromq.org http://lists.zeromq.org/mailman/listinfo/zeromq-dev
