Developer/Designer Notes

  • Archives

  • Advertisements

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

Posted in algorithms, coding | Leave a Comment »

Trees or Hashtables?

Posted by Kiran Mova on October 29, 2007

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

Posted in coding, datastructures | Leave a Comment »