Open Stack

On 10/09/2015 12:55 PM, Gregory Haynes wrote:

> There is a more generalized version of this algorithm for concurrent
> scheduling I've seen a few times - Pick N options at random, apply
> heuristic over that N to pick the best, attempt to schedule at your
> choice, retry on failure. As long as you have a fast heuristic and your
> N is sufficiently smaller than the total number of options then the
> retries are rare-ish and cheap. It also can scale out extremely well.

If you're looking for a resource that is relatively rare (say you want a 
particular hardware accelerator, or a very large number of CPUs, or even to be 
scheduled "near" to a specific other instance) then you may have to retry quite 
a lot.

Chris