performance measurements

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

 N  CPU secs Elapsed secs Memory KB Code B ≈ CPU Load
120.630.635,368439  0% 0% 3% 100%
1613.5213.5316,384439  0% 1% 1% 100%
20271.48271.59185,784439  3% 3% 2% 100%

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

ruby 2.1.5p273 (2014-11-13 revision 48405) [i686-linux]

 binary-trees Ruby #3 program source code

# The Computer Language Benchmarks Game
# http://benchmarksgame.alioth.debian.org
#
# contributed by Jesse Millikan
# Modified by Wesley Moxam and Michael Klaus
# Modified by  Chris Houhoulis:
#   trigger GC; move stretch_tree into loop; use while instead of a block

def item_check(left, item, right)
  return item if left.nil?
  item + item_check(*left) - item_check(*right)
end

def bottom_up_tree(item, depth)
  return [nil, item, nil] if depth == 0
  item_item = 2 * item
  depth -= 1
  [bottom_up_tree(item_item - 1, depth), item, bottom_up_tree(item_item, depth)]
end

max_depth = ARGV[0].to_i
min_depth = 4

max_depth = [min_depth + 2, max_depth].max

1.times do
  stretch_depth = max_depth + 1
  stretch_tree = bottom_up_tree(0, stretch_depth)
  puts "stretch tree of depth #{stretch_depth}\t check: " +
    "#{item_check(*stretch_tree)}"
end
GC.start

long_lived_tree = bottom_up_tree(0, max_depth)

base_depth = max_depth + min_depth
min_depth.step(max_depth + 1, 2) do |depth|
  iterations = 2 ** (base_depth - depth)

  check, i = 0, 1

  while i <= iterations
    temp_tree = bottom_up_tree(i, depth)
    check += item_check(*temp_tree)

    temp_tree = bottom_up_tree(-i, depth)
    check += item_check(*temp_tree)
    i += 1
  end

  puts "#{iterations * 2}\t trees of depth #{depth}\t check: #{check}"
end
GC.start

puts "long lived tree of depth #{max_depth}\t check: " +
  "#{item_check(*long_lived_tree)}"

 make, command-line, and program output logs

Fri, 14 Nov 2014 20:07:26 GMT

COMMAND LINE:
/usr/local/src/ruby/bin/ruby binarytrees.yarv-3.yarv 20

PROGRAM OUTPUT:
stretch tree of depth 21	 check: -1
2097152	 trees of depth 4	 check: -2097152
524288	 trees of depth 6	 check: -524288
131072	 trees of depth 8	 check: -131072
32768	 trees of depth 10	 check: -32768
8192	 trees of depth 12	 check: -8192
2048	 trees of depth 14	 check: -2048
512	 trees of depth 16	 check: -512
128	 trees of depth 18	 check: -128
32	 trees of depth 20	 check: -32
long lived tree of depth 20	 check: -1

Revised BSD license

  Home   Conclusions   License   Play