Dispenser.AssignmentStrategy.Greedy (dispenser v0.1.1) View Source

The Greedy AssignmentStrategy assigns events to subscribers filling their demand before considering other subscribers. On each call to assign, the order of subscribers is shuffled, meaning that in the long run all of the subscribers will get a roughly equal amount of work, but in the short run, work is assigned in a more bursty fashion.