On Mon, May 13, 2013 at 7:46 AM, Ben. <
googl...@niessen.ch> wrote:
> Each lamp gets its own queue => 10.000 lamps
> Do you have other ideas how to handle it?
You've described two ways to handle N lamps:
- 1 tube (containing all N lamps)
- N tubes (with 1 lamp per tube)
You can also do something in between these
two extremes: make 2 tubes, and put half of
the lamps into one and the other half into the
other. More generally:
- K tubes (with N/K lamps per tube)
> Can Beanstalkd handle 10.000 queues at the same time? What is the
> limitation, RAM?
Yes, RAM.
Beanstalkd has no arbitrary limit on the number
of tubes you can make, though it hasn't been
optimized specifically to handle many tubes at
a time. You should try it and see. (10000 isn't
very many tubes.)