On Fri, Sep 25, 2015 at 05:37:55PM +0200, Klaus Aehlig wrote: > > 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
I just realized that a preparation step is missing; will resend the patch series with an additional patch added at the beginning. -- Klaus Aehlig Google Germany GmbH, Dienerstr. 12, 80331 Muenchen Registergericht und -nummer: Hamburg, HRB 86891 Sitz der Gesellschaft: Hamburg Geschaeftsfuehrer: Graham Law, Christine Elizabeth Flores
