Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re: Load Balancing

by oha (Friar)
on Nov 16, 2007 at 16:28 UTC ( #651258=note: print w/replies, xml ) Need Help??


in reply to Load Balancing

The following sub make a closure with the given array. Every time the closure is called it return a random element different from the previous. It also have no loops so it's fast. Note: it will never start with the first element.
sub RnR { push my @list, @_; return sub { my $r = 1 + int rand(@list-1); # swap [0] with [$r] my $t = $list[$r]; $list[$r] = $list[0]; $list[0] = $t; return $t; } } # usage my $rnr = RnR(qw(a b c d e f g)); print "next :", $rnr->(), "\n" for (1..20);
If instead you can't keep the script persistent to each call and you want no repetition, then there is no solution.
BTW Iff you have a progressive number which increment by one for every call (this can be done on client side, or using the time iff the requests are periodic) you can split the data in two sets (or more). You can then return a random one from the first set if the progressive is even, and a random one from the second set if it's odd.

Oha

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://651258]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (4)
As of 2022-01-21 18:37 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    In 2022, my preferred method to securely store passwords is:












    Results (59 votes). Check out past polls.

    Notices?