In tiered allocation, instances are shrunk in small steps to find the next suitable size. As the step size usually is quite small compared to the distance to the next suitable size, a lot of possible allocations are tried unsuccesfully. Given that trying an allocation is quite expensive, reduce the number of attempts by using a guess-and-verify strategy.
Klaus Aehlig (3): Do not search shrinking most pressing resource twice Add efficient find for monotone predicates Use monotoneFind to improve speed of doShrink src/Ganeti/HTools/Cluster.hs | 22 +++++++++++++++------- src/Ganeti/Utils.hs | 20 ++++++++++++++++++++ 2 files changed, 35 insertions(+), 7 deletions(-) -- 2.6.0.rc2.230.g3dd15c0
