Developer/Designer Notes

Biased Random Algorithms

Posted by Kiran Mova on October 29, 2007

When more than one thread is waiting on an event, and when the event occurs, JVM would pick a random thread from this list. Is there a random algorithm, that can pick up a thread at random but with higher probability of the thread with longer wait time be picked?

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

 
%d bloggers like this: