used to tune V8. The final score is computed as the geometric mean of
the individual results to make it independent of the running times of
the individual benchmarks and of a reference system (score
100). Scores are not comparable across benchmark suite versions and
higher scores means better performance: Bigger is better!
OS kernel simulation benchmark, originally written in BCPL by Martin Richards (539 lines).
One-way constraint solver, originally written in Smalltalk by John Maloney and Mario Wolczko (880 lines).
Encryption and decryption benchmark based on code by Tom Wu (1698 lines).
Ray tracer benchmark based on code by Adam Burmister (904 lines).
Regular expression benchmark generated by extracting regular expression operations from 50 of the most popular web pages
Data manipulation benchmark that deals with splay trees and exercises the automatic memory management subsystem (394 lines).
Solves NavierStokes equations in 2D, heavily manipulating double precision arrays. Based on Oliver Hunt's code (387 lines).
Note that benchmark results are not comparable unless both results are
run with the same revision of the benchmark suite. We will be making
revisions from time to time in order to fix bugs or expand the scope
of the benchmark suite. For previous revisions and the change log see
the revisions page.