On Mon, Sep 22, 2008 at 9:34 PM, Dustin <[EMAIL PROTECTED]> wrote: > > > On Sep 22, 7:48 pm, "Steve Chu" <[EMAIL PROTECTED]> wrote: >> > Can you compare it to gearmand/beanstalkd/starling? >> >> We need a queue component that we know all the details(I mean the code >> base, and when something bad happened, we can solve it easily). We do >> not use Perl, we do not use Ruby, so we do not use gearmand and >> starling. The application developers in our company are very familiar >> with memcached clients, so we take the memcache protocol as a >> consideration. > > I use beanstalkd because it's a really nice and small C > codebase. :) You should look at it before putting too much more > effort into where you're going here, as it already solves a lot of the > problems (priority queues, time delayed jobs, blocking and partially > blocking (including non-blocking) job reservation, automatic job > reclamation due to timeout or disconnect, per-job stats, all kinds of
beanstalkd is too complicated.. with tubes and stuff like that.. and it is not persistent.. and getting started is not easy.. all i want is a q server, that has multiple queues, and follows a very simple protocol like memcaches.. memcacheq is perfect in such a scenario...
