distributed hash tables....thats the terminology I was looking for....sorry about that.
On Jan 13, 8:37 pm, noog_com <[email protected]> wrote: > Hey Group, > > I am looking into utilizing beanstalkd as our distributed message > queue system for noog.com. So far, we have been tremendously > impressed with the simplicity and power of this tool. > > Hopefully this isn’t a redundant feed; however, I was wondering if > beanstalkd has plans to support server selection through hashing (like > memcached)? What I mean is, if I have 3 servers running beanstalkd > and I want to deliver a message into the tube called “tube_a”, from > what I gather, the worker script will connect to each of the three > servers looking for jobs on “tube_a.” Is this a correct assumption? > So if I had 100 beanstalkd servers, then it would have to look through > all 100 servers to find a job under "tube_a?" If the beanstalk > server list were hashed with the key “tube_a” then, for example, > server 1 would always receive the jobs for “tube_a” (again as memcache > does). That way the worker would immediately know to look at only > server 1 for “tube_a” jobs.....should be much faster...no? > > I was thinking about expanding the current beanstalk PHP client > library to do this in order to speed up the job retrieval. Has anyone > already looked in this? What are your thoughts? > > Thanks! > > - Osmaan --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
