In that case, use strict rotation between the available processors. On Apr 15, 11:26 pm, "w.s miller" <wentworth.miller6...@gmail.com> wrote: > here is something more specified about problem.. > > suppose node A is generating the traffic and Node B,C,D....can process > it.we have to write an algorithm at node A such that it selects a node out > of B,C,D....We do not know about the current traffic at each processing > node.We have to determine at node A so that the traffic node A is > generating is shared by all processing units equally.furthermore ..you can > assume that the status of a processing unit is known at node A ,whether it > is up or down. > > > > > > > > On Tue, Apr 16, 2013 at 12:23 AM, Don <dondod...@gmail.com> wrote: > > I think that is called a load leveler. It needs to keep track of the > > status of the resources, and the capacity of each one, when means that > > it must be able to detect when a processor goes down. It should be > > able to monitor the queue length of each processor and distribute the > > requests to the least busy processor. If no processors have a queue of > > requests waiting, requests could just be assigned in rotating order. > > Finally, the system needs to be able to recover when one processor > > goes down, which means that it must store the contents of each > > request, and if the response times out, it must send the request to > > another processor. Alternatively, fault recovery can be achieved by > > redundancy, sending every request to two processors and using the > > first response. This should improve worst case response time, but > > obviously it requires twice as many processors. > > > Don > > > On Apr 15, 5:09 am, "w.s miller" <wentworth.miller6...@gmail.com> > > wrote: > > > suppose we have n processing units.we have an incoming traffic which is > > to > > > be > > > distributed among them.but we have to take in mind that load is to be > > > equally distibuted and if one of the processing units goes down ,then we > > > have to distribute the traffic to rest of the processing units.Also when > > > the processing unit which is down comes up,then the traffic distribution > > is > > > to be handled .... > > > > please suggest any suitable data structure or algorithm.... > > > > thanks > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To unsubscribe from this group and stop receiving emails from it, send an > > email to algogeeks+unsubscr...@googlegroups.com. > > For more options, visithttps://groups.google.com/groups/opt_out.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
