[Spread-users] Spread for HA rpc services
vangale at fastmail.fm
Wed Aug 8 16:48:26 EDT 2007
Colin Meyer wrote:
> On Wed, Aug 08, 2007 at 02:14:41PM -0400, Daniel F. Savarese wrote:
>> There are a number of different ways to do what you describe with
>> Spread, but you have to select the most appropriate algorithm for
>> your application and implement it. For example, one approach is
>> for only the "leader" process to process the request, giving up
>> leadership and passing it to the next available process. Another
>> approach is to implement a work queue and have each worker process
>> ask the work queue/manager for work.
> Ok, this makes sense. Could you point me to any examples or recipes for
> this sort of implementation?
A simple and commonly suggested implementation is to use hashing. Each
incoming message is hashed by all group members, but only the member who
is the right "bucket" will do the work.
A big problem, at least in my mind, for using spread in this type of
application is what happens in a network partition if a client ends up
in a different partition from a worker who was in the middle of
processing a request.
More information about the Spread-users