/mobile Handheld Friendly website
Ubuntu : Intel® Q6600® quad-core |
Each table row shows performance measurements for this Ruby JRuby program with a particular command-line input value N.
| N | CPU secs | Elapsed secs | Memory KB | Code B | ≈ CPU Load |
|---|---|---|---|---|---|
| 12 | 3.95 | 4.86 | 146,320 | 412 | 4% 22% 72% 30% |
| 16 | 9.75 | 7.14 | 579,616 | 412 | 2% 93% 22% 22% |
| 20 | 263.75 | 141.78 | 868,844 | 412 | 31% 94% 31% 31% |
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.
jruby 1.7.2 (1.9.3p327) 2013-01-04 302c706 on Java HotSpot(TM) Server VM 1.7.0_11-b21 [linux-i386]
# The Computer Language Shootout Benchmarks # http://benchmarksgame.alioth.debian.org # # contributed by Jesse Millikan # Modified by Wesley Moxam 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] unless 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 if min_depth + 2 > max_depth 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)}" stretch_tree = nil long_lived_tree = bottom_up_tree(0, max_depth) min_depth.step(max_depth + 1, 2) do |depth| iterations = 2**(max_depth - depth + min_depth) check = 0 for i in 1..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) end puts "#{iterations * 2}\t trees of depth #{depth}\t check: #{check}" end puts "long lived tree of depth #{max_depth}\t check: #{item_check(*long_lived_tree)}"
Sat, 19 Jan 2013 19:46:53 GMT MAKE: mv binarytrees.jruby binarytrees.rb 0.04s to complete and log all make actions COMMAND LINE: /usr/local/src/jruby-1.7.2/bin/jruby -Xcompile.invokedynamic=true -J-server -J-Xmn512m -J-Xms768m -J-Xmx768m binarytrees.rb 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