On Wed, Jan 19, 2011 at 11:14 PM, Chad Kouse <[email protected]> wrote: > My question was more related > to the fact that these will all be delayed jobs and I don't know how > beanstalkd handles managing when they become ready. I was concerned > it would add a lot of overhead.
The delay queue is implemented with a binary heap, just like the ready queue. There's only one timer for the delay queue; that timer is set to fire at the end of the delay time of the job at the top of the heap. The speed behavior of beanstalkd with a large delay queue should be similar to its speed behavior with a large ready queue. kr -- You received this message because you are subscribed to the Google Groups "beanstalk-talk" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/beanstalk-talk?hl=en.
