[Spread-users] Queue functionality in Spread

Jonathan Stanton jonathan at cnds.jhu.edu
Wed Feb 11 17:43:49 EST 2004

What are the requirements for message distribution within a group? For 
example does it have to be fair? Based on current load? Time? Other 

If the rule can be made deterministic, then each subscriber in each group 
could just receive all of the messages, and then each member of each group 
would deterministicly throw away ones it should not process. When a 
membership change is detected then survivers can take over for the crashed 
process in the deterministic rule.

Does that seem applicable?


On Tue, Feb 10, 2004 at 05:18:07PM -0800, Anurag Gupta wrote:
> Hi,
> We have a hybrid requirement:
> 3 Publishers (P1, P2, P3)
> 15 Subscribers that can be divided into 5 groups (say g1-g5). Each group of
> subscriber has 3 machines each.
> We want any published message to be delivered to 1 machine in each group.
> Basically, pub-sub + queue. Has somebody got this configuration running? We
> want to avoid single point of failure even if it costs us something in
> performance.
> I was thinking of getting all the machines in group g1 to vote on any
> message that they get. Whoever wins gets to process the message.
> Spread Perl has something on the line of pure Queues - but it looked to me
> that they have a QueueManager which may be a single point of failure
> (correct me if I am wrong there).
> Ideas?
> ======================
> Regards
> Anurag Gupta
> agupta at yahoo-inc.com
> 408.349.5166
> _______________________________________________
> Spread-users mailing list
> Spread-users at lists.spread.org
> http://lists.spread.org/mailman/listinfo/spread-users

Jonathan R. Stanton         jonathan at cs.jhu.edu
Dept. of Computer Science   
Johns Hopkins University    

More information about the Spread-users mailing list