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?

Trees or Hashtables?

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