Developer/Designer Notes http://webjournl.wordpress.com Mon, 29 Oct 2007 23:00:56 +0000 http://wordpress.com/ en hourly 1 http://www.gravatar.com/blavatar/cfbb9b855f40f32eda2b3949de843a46?s=96&d=http://s.wordpress.com/i/buttonw-com.png Developer/Designer Notes http://webjournl.wordpress.com Biased Random Algorithms http://webjournl.wordpress.com/2007/10/29/biased-random-algorithms/ http://webjournl.wordpress.com/2007/10/29/biased-random-algorithms/#comments Mon, 29 Oct 2007 23:00:56 +0000 Kiran Mova http://webjournl.wordpress.com/2007/10/29/biased-random-algorithms/ ]]>

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?

]]> http://webjournl.wordpress.com/2007/10/29/biased-random-algorithms/feed/ 0 kiranmova Trees or Hashtables? http://webjournl.wordpress.com/2007/10/29/trees-or-hashtables/ http://webjournl.wordpress.com/2007/10/29/trees-or-hashtables/#comments Mon, 29 Oct 2007 22:55:57 +0000 Kiran Mova http://webjournl.wordpress.com/2007/10/29/trees-or-hashtables/ ]]>

For large datasets, which option would work better in terms of memory consumption and performance?

]]> http://webjournl.wordpress.com/2007/10/29/trees-or-hashtables/feed/ 0 kiranmova