• Klaus Aehlig's avatar
    Improve speed of iterateAlloc by a trying two step sizes · 70efca11
    Klaus Aehlig authored
    Currently, iterateAlloc tries one guess on the remaining capacity
    and falls back to small steps if that guess turns out to be too
    optimistic. In the typical case, that the allocation is bound by
    memory that initial guess works quite well; however, in some cases
    other requirements limit the amount of instances allocatable on a
    cluster. Instead of immediately giving up in this case, try smaller
    guess-and-verify steps to avoid having to check for global N+1 redundancy
    too often.
    Signed-off-by: default avatarKlaus Aehlig <aehlig@google.com>
    Reviewed-by: default avatarPetr Pudlak <pudlak@google.com>
    70efca11
Name
Last commit
Last update
autotools Loading commit data...
cabal Loading commit data...
daemons Loading commit data...
devel Loading commit data...
doc Loading commit data...
lib Loading commit data...
man Loading commit data...
qa Loading commit data...
src Loading commit data...
test Loading commit data...
tools Loading commit data...
.ghci Loading commit data...
.gitignore Loading commit data...
COPYING Loading commit data...
INSTALL Loading commit data...
Makefile.am Loading commit data...
NEWS Loading commit data...
README Loading commit data...
UPGRADE Loading commit data...
autogen.sh Loading commit data...
configure.ac Loading commit data...
epydoc.conf.in Loading commit data...
pylintrc Loading commit data...
pylintrc-test Loading commit data...