x64 Ubuntu : Intel® Q6600® one 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 JavaScript V8 Lisp SBCL Lua OCaml Pascal Free Pascal Perl PHP Python 3 Racket Ruby 2.0 Ruby JRuby Scala Smalltalk VisualWorks x86 one core x64 quad-core x86 quad-core x64 one core

 performance measurements

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

N	CPU secs	Elapsed secs	Memory KB	Code B	≈ CPU Load
10	0.46	0.48	6,312	539	2% 0% 2% 100%
11	5.66	5.67	6,308	539	0% 0% 0% 100%
12	78.67	78.70	6,312	539	0% 0% 0% 100%

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

Read fannkuch-redux benchmark to see what this program should do.

 notes

V8 version 3.19.18 (candidate) [console: dumb]

 fannkuch-redux JavaScript V8 #3 program source code

/* The Computer Language Benchmarks Game
   http://benchmarksgame.alioth.debian.org/

   contributed by Isaac Gouy, transliterated from Mike Pall's Lua program 
   Modified by Roy Williams.
*/

function fannkuch(n) {
  var storage = new ArrayBuffer(12 * n);
  var p = new Int32Array(storage, 0, n), 
      q = new Int32Array(storage, n * 4, n), 
      s = new Int32Array(storage, n * 8, n);
  var sign = 1, maxflips = 0, sum = 0, m = n-1;
  
  for(var i=0; i<n; i++){ 
    p[i] = i; 
    q[i] = i; 
    s[i] = i; 
  }
  do {
    // Copy and flip.
    var q0 = p[0];                                     // Cache 0th element.
    if (q0 != 0){
      for(var i=1; i<n; i++) {
        q[i] = p[i];             // Work on a copy.
      }
      var flips = 1;
      do { 
        var qq = q[q0]; 
        if (qq == 0) {                            // ... until 0th element is 0.
          sum = (sum + sign*flips) | 0;
          if (flips > maxflips) {
            maxflips = flips;   // New maximum?
          }
          break; 
        } 
        q[q0] = q0; 
        if (q0 >= 3) {
          var i = 1, 
              j = (q0 - 1) | 0, 
              t;
          do {
            t = q[i]; 
            q[i] = q[j]; 
            q[j] = t; 
            i = (i + 1) | 0;
            j = (j - 1) | 0;
          } while (i < j); 
        }
        q0 = qq; 
        flips = (flips + 1) | 0; 
      } while (true); 
    }
    // Permute.
    if (sign == 1) {
      var t = p[1];
      p[1] = p[0];
      p[0] = t;
      sign = -1; // Rotate 0<-1.
    } else { 
      var t = p[1];
      p[1] = p[2]; 
      p[2] = t; 
      sign = 1;  // Rotate 0<-1 and 0<-1<-2.
      for(var i=2; i<n; i++) { 
        var sx = s[i];
        if (sx != 0) {
          s[i] = (sx-1) | 0;
          break; 
        }
        if (i == m) { 
          return Array(sum,maxflips);      // Out of permutations.
        }
        s[i] = i;
        // Rotate 0<-...<-i+1.
        t = p[0]; 
        for(var j=0; j<=i; j++) {
          p[j] = p[j+1];
        } 
        p[i+1] = t;
      }
    }
  } while (true);
}

var n = +arguments[0];
var pf = fannkuch(n);
print(pf[0] + "\n" + "Pfannkuchen(" + n + ") = " + pf[1]);

 make, command-line, and program output logs

Tue, 18 Jun 2013 18:30:56 GMT

COMMAND LINE:
/usr/local/src/v8/out/native/d8 --nodebugger fannkuchredux.v8-3.v8 -- 12

PROGRAM OUTPUT:
3968050
Pfannkuchen(12) = 65

  Home   Conclusions   License   Play