My favorites | Sign in
Project Logo
             
Search
for
Updated Jan 16, 2008 by jonhohle
Benchmarks  

A list of comparisons from the Computer Language Benchmark Game against. SpiderMonkey. All of these tests were run on a 2.2GHz Core 2 Duo.

When n is not defined it is the same as the n noted in the Computer Language Benchmark page.

Benchmark jscsh SpiderMonkey
Binary Tree 165.05 155.19
fannkuch (n=9) 9.329 10.19
fasta (n=500,000) 26.988 37.88
nsieve 121.41 31.21
nsieve-bits (n=9) 54.08 26.21
partial-sums 21.62 36.82
recursive (n=5) 4.79 5.04 note: n > 5 caused jscsh to fail with RangeError: Maximum call stack size exceeded.
spectral-norm (n=500) 20.77 23.61
startup


Sign in to add a comment
Hosted by Google Code