Last active
November 27, 2017 21:49
-
-
Save eprev/bc7114fdf7d9398c461f79c028f48abd to your computer and use it in GitHub Desktop.
Matrix #jsbench #jsperf (http://jsbench.github.io/#bc7114fdf7d9398c461f79c028f48abd) #jsbench #jsperf
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<!DOCTYPE html> | |
<html> | |
<head> | |
<meta charset="utf-8"/> | |
<title>Matrix #jsbench #jsperf</title> | |
<script src="https://cdnjs.cloudflare.com/ajax/libs/benchmark/1.0.0/benchmark.min.js"></script> | |
<script src="./suite.js"></script> | |
</head> | |
<body> | |
<h1>Open the console to view the results</h1> | |
<h2><code>cmd + alt + j</code> or <code>ctrl + alt + j</code></h2> | |
</body> | |
</html> |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
"use strict"; | |
(function (factory) { | |
if (typeof Benchmark !== "undefined") { | |
factory(Benchmark); | |
} else { | |
factory(require("benchmark")); | |
} | |
})(function (Benchmark) { | |
var suite = new Benchmark.Suite; | |
suite.add("\"use asm\";", function () { | |
"use asm"; | |
const N = 128|0; | |
let m1 = new Uint32Array(N * N); | |
let m2 = new Uint32Array(N * N); | |
let res = new Uint32Array(N * N); | |
for (let i = 0|0; (i|0) < (N|0); i=(i+1)|0) { | |
for (let j = 0|0; (j|0) < (N|0); j=(j+1)|0) { | |
for (let k = 0|0; (k|0) < (N|0); k=(k+1)|0) { | |
res[(i << 7) + j|0] += m1[(i << 7) + k|0] * m2[(k << 7) + j|0] | |
} | |
} | |
} | |
}); | |
suite.add("\"use asm\";", function () { | |
"use asm"; | |
const N = 128|0; | |
let m1 = new Uint32Array(N * N); | |
let m2 = new Uint32Array(N * N); | |
let tmp = new Uint32Array(N * N); | |
let res = new Uint32Array(N * N); | |
for (let i = 0|0; (i|0) < (N|0); i=(i+1)|0) { | |
for (let j = 0|0; (j|0) < (N|0); j=(j+1)|0) { | |
tmp[(i << 7) + j|0] = m2[(j << 7) + i|0]; | |
} | |
} | |
for (let i = 0|0; (i|0) < (N|0); i=(i+1)|0) { | |
for (let j = 0|0; (j|0) < (N|0); j=(j+1)|0) { | |
for (let k = 0|0; (k|0) < (N|0); k=(k+1)|0) { | |
res[(i << 7) + j|0] += m1[(i << 7) + k|0] * tmp[(j << 7) + k|0] | |
} | |
} | |
} | |
}); | |
suite.on("cycle", function (evt) { | |
console.log(" - " + evt.target); | |
}); | |
suite.on("complete", function (evt) { | |
console.log(new Array(30).join("-")); | |
var results = evt.currentTarget.sort(function (a, b) { | |
return b.hz - a.hz; | |
}); | |
results.forEach(function (item) { | |
console.log((idx + 1) + ". " + item); | |
}); | |
}); | |
console.log("Matrix #jsbench #jsperf"); | |
console.log(new Array(30).join("-")); | |
suite.run(); | |
}); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment