Commit 863d5fdf authored by ulan@chromium.org's avatar ulan@chromium.org

More fixes for V8 benchmark version 7.

R=rossberg@chromium.org

Review URL: https://chromiumcodereview.appspot.com/9701067

git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@11064 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
parent 4898f5bd
...@@ -77,3 +77,10 @@ input strings. ...@@ -77,3 +77,10 @@ input strings.
Furthermore, the benchmark runner was changed to run the benchmarks Furthermore, the benchmark runner was changed to run the benchmarks
for at least a few times to stabilize the reported numbers on slower for at least a few times to stabilize the reported numbers on slower
machines. machines.
Changes from Version 6 to Version 7
===================================
Added the Navier-Stokes benchmark, a 2D differential equation solver
that stresses arithmetic computations on double arrays.
...@@ -21,7 +21,8 @@ the benchmark suite. ...@@ -21,7 +21,8 @@ the benchmark suite.
</p> </p>
<div class="subtitle"><h3>Version 7 (<a href="http://v8.googlecode.com/svn/data/benchmarks/v7/run.html">link</a>)</h3></div> <div class="subtitle"><h3>Version 7 (<a href="http://v8.googlecode.com/svn/data/benchmarks/v7/run.html">link</a>)</h3></div>
<p>This versions include the new Navier-Stokes benchmark, a 2D differential equation solver that stresses arithmetic computations on double arrays.</p> <p>This version includes the new Navier-Stokes benchmark, a 2D differential
equation solver that stresses arithmetic computations on double arrays.</p>
<div class="subtitle"><h3>Version 6 (<a href="http://v8.googlecode.com/svn/data/benchmarks/v6/run.html">link</a>)</h3></div> <div class="subtitle"><h3>Version 6 (<a href="http://v8.googlecode.com/svn/data/benchmarks/v6/run.html">link</a>)</h3></div>
......
...@@ -118,7 +118,7 @@ higher scores means better performance: <em>Bigger is better!</em> ...@@ -118,7 +118,7 @@ higher scores means better performance: <em>Bigger is better!</em>
(<i>1761 lines</i>). (<i>1761 lines</i>).
</li> </li>
<li><b>Splay</b><br>Data manipulation benchmark that deals with splay trees and exercises the automatic memory management subsystem (<i>394 lines</i>).</li> <li><b>Splay</b><br>Data manipulation benchmark that deals with splay trees and exercises the automatic memory management subsystem (<i>394 lines</i>).</li>
<li><b>NavierStokes (beta)</b><br>Solves NavierStokes equations in 2D, heavily manipulating double precision arrays. Based on Oliver Hunt's code (<i>396 lines</i>).</li> <li><b>NavierStokes</b><br>Solves NavierStokes equations in 2D, heavily manipulating double precision arrays. Based on Oliver Hunt's code (<i>387 lines</i>).</li>
</ul> </ul>
<p> <p>
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment