Ubuntu : Intel® Q6600® quad-core
Computer Language Benchmarks Game      [[ Play ]]

- all benchmarks - n-body fannkuch-redux meteor-contest fasta fasta-redux spectral-norm reverse-complement mandelbrot k-nucleotide regex-dna pidigits chameneos-redux thread-ring binary-trees-redux binary-trees - all languages - Ada 2005 GNAT ATS C gcc Clojure C# Mono C++ g++ Dart Erlang HiPE F# Mono Fortran Intel Go Haskell GHC Java 7 Lisp SBCL OCaml Pascal Free Pascal Perl PHP Python 3 Racket Ruby 2.0 Ruby JRuby Scala x86 one core x64 quad-core x86 quad-core x64 one core

 performance measurements

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

N	CPU secs	Elapsed secs	Memory KB	Code B	≈ CPU Load
12	0.04	0.02	?	872	0% 67% 33% 50%
16	0.72	0.34	260	872	6% 85% 65% 63%
20	16.40	7.87	107,712	872	91% 77% 11% 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.

 notes

go version go1.1.1 linux/386

Custom pool implementation.

 binary-trees Go #3 program source code

/* The Computer Language Benchmarks Game
 * http://benchmarksgame.alioth.debian.org/
 *
 * contributed by The Go Authors.
 * based on C program by Kevin Carson
 * flag.Arg hack by Isaac Gouy
 * custom pool and parallel loops by JONNALAGADDA Srinivas
 */

package main

import (
   "flag"
   "fmt"
   "runtime"
   "strconv"
)

type NodeStore struct {
   brk   int
   idx   int
   store []Node
}

func (s *NodeStore) Init(depth int) {
   s.brk = 1 << uint(depth+1)
   s.idx = -1
   s.store = make([]Node, s.brk)
}

func (s *NodeStore) ReInit() {
   s.idx = -1
}

func (s *NodeStore) Alloc(i int, l, r *Node) *Node {
   s.idx++
   p := &(s.store[s.idx])
   (*p).item = i
   (*p).left = l
   (*p).right = r
   return p
}

var n = 0

type Node struct {
   item        int
   left, right *Node
}

func bottomUpTree(item, depth int, store *NodeStore) *Node {
   if depth <= 0 {
      return store.Alloc(item, nil, nil)
   }
   return store.Alloc(item,
      bottomUpTree(2*item-1, depth-1, store),
      bottomUpTree(2*item, depth-1, store))
}

func (n *Node) itemCheck() int {
   if n.left == nil {
      return n.item
   }
   return n.item + n.left.itemCheck() - n.right.itemCheck()
}

const minDepth = 4
const MAXPROCS = 4

func main() {
   flag.Parse()
   if flag.NArg() > 0 {
      n, _ = strconv.Atoi(flag.Arg(0))
   }

   runtime.GOMAXPROCS(MAXPROCS)

   maxDepth := n
   if minDepth+2 > n {
      maxDepth = minDepth + 2
   }
   stretchDepth := maxDepth + 1

   store := new(NodeStore)
   store.Init(stretchDepth)
   check := bottomUpTree(0, stretchDepth, store).itemCheck()
   fmt.Printf("stretch tree of depth %d\t check: %d\n", stretchDepth, check)

   longLivedStore := new(NodeStore)
   longLivedStore.Init(maxDepth)
   longLivedTree := bottomUpTree(0, maxDepth, longLivedStore)

   ss := make([]string, maxDepth+1)
   fn := func(min, max int, ch chan int) {
      for depth := min; depth <= max; depth += (2 * MAXPROCS) {
         iterations := 1 << uint(maxDepth-depth+minDepth)
         check := 0

         store := new(NodeStore)
         store.Init(depth)
         for i := 1; i <= iterations; i++ {
            store.ReInit()
            check += bottomUpTree(i, depth, store).itemCheck()
            store.ReInit()
            check += bottomUpTree(-i, depth, store).itemCheck()
         }
         ss[depth] = fmt.Sprintf("%d\t trees of depth %d\t check: %d\n",
            iterations*2, depth, check)
      }
      ch <- 0
   }

   ch := make(chan int, MAXPROCS)
   for i := 0; i < MAXPROCS; i++ {
      go fn(minDepth+(i*2), maxDepth, ch)
   }
   for i := 0; i < MAXPROCS; i++ {
      <-ch
   }
   for i := minDepth; i <= maxDepth; i += 2 {
      fmt.Print(ss[i])
   }

   fmt.Printf("long lived tree of depth %d\t check: %d\n",
      maxDepth, longLivedTree.itemCheck())
}

 make, command-line, and program output logs

Thu, 13 Jun 2013 21:38:30 GMT

MAKE:
/usr/local/src/go/bin/go build -o binarytrees.go-3.go_run
0.30s to complete and log all make actions

COMMAND LINE:
./binarytrees.go-3.go_run 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

  Home   Conclusions   License   Play