performance measurements

Each table row shows performance measurements for this Nuitka program with a particular command-line input value N.

 N  CPU secs Elapsed secs Memory KB Code B ≈ CPU Load
142.460.7667,564741  85% 82% 88% 84%
142.490.7664,448741  88% 92% 81% 86%
142.500.7669,384741  87% 82% 84% 91%

Read the ↓ make, command line, and program output logs to see how this program was run.

Read binary-trees benchmark to see what this program should do.

 notes

 binary-trees Nuitka #7 program source code

# The Computer Language Benchmarks Game
# http://benchmarksgame.alioth.debian.org/
#
# contributed by Antoine Pitrou
# modified by Dominique Wahli and Daniel Nanz
# modified by Joerg Baumann

import sys
import multiprocessing as mp
import gc

def make_tree(i, d):
    if d > 0:
        d -= 1
        return (i, make_tree(i, d), make_tree(i + 1, d))
    return (i, None, None)

def check_tree(node):
    (i, l, r) = node
    if l is None:
        return i
    else:
        return i + check_tree(l) - check_tree(r)

def make_check(itde, make=make_tree, check=check_tree):
    i, d = itde
    return check(make(i, d))

def get_argchunks(i, d, chunksize=5000):
    assert chunksize % 2 == 0
    chunk = []
    for k in range(1, i + 1):
        chunk.extend([(k, d), (-k, d)])
        if len(chunk) == chunksize:
            yield chunk
            chunk = []
    if len(chunk) > 0:
        yield chunk

def main(n, min_depth=4):
    max_depth = max(min_depth + 2, n)
    stretch_depth = max_depth + 1
    if mp.cpu_count() > 1:
        pool = mp.Pool()
        chunkmap = pool.map
    else:
        chunkmap = map

    print('stretch tree of depth {0}\t check: {1}'.format(
          stretch_depth, make_check((0, stretch_depth))))

    long_lived_tree = make_tree(0, max_depth)

    mmd = max_depth + min_depth
    for d in range(min_depth, stretch_depth, 2):
        i = 2 ** (mmd - d)
        cs = 0
        for argchunk in get_argchunks(i,d):
            cs += sum(chunkmap(make_check, argchunk))
        print('{0}\t trees of depth {1}\t check: {2}'.format(i * 2, d, cs))

    print('long lived tree of depth {0}\t check: {1}'.format(
          max_depth, check_tree(long_lived_tree)))

if __name__ == '__main__':
    gc.disable()
    main(int(sys.argv[1]))
    gc.enable()

 make, command-line, and program output logs

Thu, 21 Feb 2019 10:02:18 GMT

MAKE:
make[1]: Vstupuje se do adresáře „/home/dundee/workspace/benchmarksgame/bencher/tmp/binarytrees/tmp“
nuitka3 --remove-output binarytrees.nuitka-7.nuitka
cp binarytrees.nuitka-7.nuitka.bin binarytrees.nuitka-7.nuitka_run
make[1]: Opouští se adresář „/home/dundee/workspace/benchmarksgame/bencher/tmp/binarytrees/tmp“
3.60s to complete and log all make actions

COMMAND LINE:
./binarytrees.nuitka-7.nuitka_run 14

PROGRAM OUTPUT:
stretch tree of depth 15	 check: -1
32768	 trees of depth 4	 check: -32768
8192	 trees of depth 6	 check: -8192
2048	 trees of depth 8	 check: -2048
512	 trees of depth 10	 check: -512
128	 trees of depth 12	 check: -128
32	 trees of depth 14	 check: -32
long lived tree of depth 14	 check: -1

Revised BSD license

  Home   Conclusions   License   Play