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.420.4327,8761123  0% 0% 2% 100%
167.937.94100,7641123  1% 1% 1% 100%
20160.00160.18257,6001123  1% 1% 0% 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.0p0 (2013-12-25 revision 44422) [x86_64-linux]

 binary-trees Ruby #5 program source code

# The Computer Language Benchmarks Game
# http://benchmarksgame.alioth.debian.org
#
# contributed by Jesse Millikan
# Modified by Wesley Moxam
# Modified && Parallelised by Scott Leggett

module MiniParallel
    class Worker
        def initialize(read, write)
            @read, @write = read, write
        end

        def close_pipes
            @read.close
            @write.close
        end

        def work(index)
            Marshal.dump(index, @write)
            Marshal.load(@read)
        end
    end

    def self.map(array, &block)
        work_in_processes(
            array,
            [array.size, core_count].min,
            &block
        )
    end

    def self.core_count
        @@core_count ||= IO.read("/proc/cpuinfo").scan(/^processor/).size
    end

    private

    def self.work_in_processes(array, count, &block)
        index = -1
        results, threads = [], []

        workers = create_workers(array, count, &block)

        workers.each do |worker|
            threads << Thread.new do
              loop do
                Thread.exclusive{ index += 1 }
                break if index >= array.size
                results[index] = worker.work(index)
              end
              worker.close_pipes
            end
        end

        threads.each(&:join)
        Process.waitall

        results
    end

    def self.create_workers(array, count, &block)
        workers = []
        count.times do
            workers << create_worker(array, workers, &block)
        end
        workers
    end

    def self.create_worker(array, started_workers, &block)
        child_read, parent_write = IO.pipe
        parent_read, child_write = IO.pipe

        Process.fork do
            started_workers.each(&:close_pipes)

            parent_write.close
            parent_read.close

            process_incoming_jobs(child_read, child_write, array, &block)

            child_read.close
            child_write.close
        end

        child_read.close
        child_write.close

        Worker.new(parent_read, parent_write)
    end

    def self.process_incoming_jobs(read, write, array, &block)
        until read.eof?
            index = Marshal.load(read)
            Marshal.dump(block.call(array[index]), write)
        end
    end
end

def item_check(left, item, right)
    if left
        item + item_check(*left) - item_check(*right)
    else
        item
    end
end

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

max_depth = ARGV[0].to_i
min_depth = 4

max_depth = [min_depth + 2, max_depth].max

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)

if MiniParallel.core_count > 1
    if RUBY_PLATFORM == 'java'
        output = []
        threads = []
        min_depth.step(max_depth + 1, 2).to_a.each.with_index do |depth,j|
            threads << Thread.new do
                iterations = 2**(max_depth - depth + min_depth)

                check = 0

                (1..iterations).each do |i|
                    check += item_check(*bottom_up_tree(i, depth)) +
                        item_check(*bottom_up_tree(-i, depth))
                end

                output[j] = "#{iterations * 2}\t trees of depth #{depth}\t check: #{check}"
            end
        end
        threads.all?(&:join)
        output.each{|l| puts l}
    else
        MiniParallel.map(min_depth.step(max_depth + 1, 2).to_a) do |depth|
            iterations = 2**(max_depth - depth + min_depth)

            check = 0

            (1..iterations).each do |i|
                check += item_check(*bottom_up_tree(i, depth)) +
                    item_check(*bottom_up_tree(-i, depth))
            end

            "#{iterations * 2}\t trees of depth #{depth}\t check: #{check}"
        end.each{|l| puts l}
    end
else
    min_depth.step(max_depth + 1, 2).each do |depth|
        iterations = 2**(max_depth - depth + min_depth)

        check = 0

        (1..iterations).each do |i|
            check += item_check(*bottom_up_tree(i, depth)) +
                item_check(*bottom_up_tree(-i, depth))
        end

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

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

 make, command-line, and program output logs

Wed, 20 Aug 2014 17:35:01 GMT

COMMAND LINE:
/usr/local/src/ruby/bin/ruby binarytrees.yarv-5.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