The general lesson is that randomized algorithms often remove the need for synchronization between concurrent processes. For example, choosing ids at random fro

The general lesson is that randomized algorithms often remove the need for synchronization between concurrent processes. For example, choosing ids at random from a large space rather than coordinating to choose unique ids.