| OLD | NEW |
| 1 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01//EN" | 1 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01//EN" |
| 2 "http://www.w3.org/TR/html4/strict.dtd"> | 2 "http://www.w3.org/TR/html4/strict.dtd"> |
| 3 <html lang="en"> | 3 <html lang="en"> |
| 4 <head> | 4 <head> |
| 5 <meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"> | 5 <meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"> |
| 6 <meta http-equiv="Content-Script-Type" content="text/javascript"> | 6 <meta http-equiv="Content-Script-Type" content="text/javascript"> |
| 7 <meta http-equiv="Content-Style-Type" content="text/css"> | 7 <meta http-equiv="Content-Style-Type" content="text/css"> |
| 8 <title>V8 Benchmark Suite</title> | 8 <title>V8 Benchmark Suite</title> |
| 9 <script type="text/javascript" src="base.js"></script> | 9 <script type="text/javascript" src="base.js"></script> |
| 10 <script type="text/javascript" src="richards.js"></script> | 10 <script type="text/javascript" src="richards.js"></script> |
| (...skipping 35 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 46 if (success) { | 46 if (success) { |
| 47 status.innerHTML = "Score: " + score; | 47 status.innerHTML = "Score: " + score; |
| 48 } | 48 } |
| 49 } | 49 } |
| 50 | 50 |
| 51 | 51 |
| 52 function Run() { | 52 function Run() { |
| 53 BenchmarkSuite.RunSuites({ NotifyStep: ShowProgress, | 53 BenchmarkSuite.RunSuites({ NotifyStep: ShowProgress, |
| 54 NotifyError: AddError, | 54 NotifyError: AddError, |
| 55 NotifyResult: AddResult, | 55 NotifyResult: AddResult, |
| 56 NotifyScore: AddScore }); | 56 NotifyScore: AddScore }); |
| 57 } | 57 } |
| 58 | 58 |
| 59 function ShowWarningIfObsolete() { | 59 function ShowWarningIfObsolete() { |
| 60 // If anything goes wrong we will just catch the exception and no | 60 // If anything goes wrong we will just catch the exception and no |
| 61 // warning is shown, i.e., no harm is done. | 61 // warning is shown, i.e., no harm is done. |
| 62 try { | 62 try { |
| 63 var xmlhttp; | 63 var xmlhttp; |
| 64 var next_version = parseInt(BenchmarkSuite.version) + 1; | 64 var next_version = parseInt(BenchmarkSuite.version) + 1; |
| 65 var next_version_url = "../v" + next_version + "/run.html"; | 65 var next_version_url = "../v" + next_version + "/run.html"; |
| 66 if (window.XMLHttpRequest) { | 66 if (window.XMLHttpRequest) { |
| 67 xmlhttp = new window.XMLHttpRequest(); | 67 xmlhttp = new window.XMLHttpRequest(); |
| 68 } else if (window.ActiveXObject) { | 68 } else if (window.ActiveXObject) { |
| 69 xmlhttp = new window.ActiveXObject("Microsoft.XMLHTTP"); | 69 xmlhttp = new window.ActiveXObject("Microsoft.XMLHTTP"); |
| 70 } | 70 } |
| 71 xmlhttp.open('GET', next_version_url, true); | 71 xmlhttp.open('GET', next_version_url, true); |
| 72 xmlhttp.onreadystatechange = function() { | 72 xmlhttp.onreadystatechange = function() { |
| 73 if (xmlhttp.readyState == 4 && xmlhttp.status == 200) { | 73 if (xmlhttp.readyState == 4 && xmlhttp.status == 200) { |
| 74 document.getElementById('obsolete').style.display="block"; | 74 document.getElementById('obsolete').style.display="block"; |
| 75 } | 75 } |
| 76 }; | 76 }; |
| 77 xmlhttp.send(null); | 77 xmlhttp.send(null); |
| 78 } catch(e) { | 78 } catch(e) { |
| 79 // Ignore exception if check for next version fails. | 79 // Ignore exception if check for next version fails. |
| 80 // Hence no warning is displayed. | 80 // Hence no warning is displayed. |
| 81 } | 81 } |
| 82 } | 82 } |
| 83 | 83 |
| 84 function Load() { | 84 function Load() { |
| 85 var version = BenchmarkSuite.version; | 85 var version = BenchmarkSuite.version; |
| 86 document.getElementById("version").innerHTML = version; | 86 document.getElementById("version").innerHTML = version; |
| 87 ShowWarningIfObsolete(); | 87 ShowWarningIfObsolete(); |
| 88 setTimeout(Run, 200); | 88 setTimeout(Run, 200); |
| 89 } | 89 } |
| 90 </script> | 90 </script> |
| 91 </head> | 91 </head> |
| 92 <body onload="Load()"> | 92 <body onload="Load()"> |
| 93 <div> | 93 <div> |
| 94 <div class="title"><h1>V8 Benchmark Suite - version <span id="version">?</span
></h1></div> | 94 <div class="title"><h1>V8 Benchmark Suite - version <span id="version">?</span
></h1></div> |
| 95 <div class="warning" id="obsolete"> | 95 <div class="warning" id="obsolete"> |
| 96 Warning! This is not the latest version of the V8 benchmark | 96 Warning! This is not the latest version of the V8 benchmark |
| 97 suite. Consider running the | 97 suite. Consider running the |
| 98 <a href="http://v8.googlecode.com/svn/data/benchmarks/current/run.html"> | 98 <a href="http://v8.googlecode.com/svn/data/benchmarks/current/run.html"> |
| 99 latest version</a>. | 99 latest version</a>. |
| 100 </div> | 100 </div> |
| 101 <table> | 101 <table> |
| 102 <tr> | 102 <tr> |
| 103 <td class="contents"> | 103 <td class="contents"> |
| 104 This page contains a suite of pure JavaScript benchmarks that we have | 104 This page contains a suite of pure JavaScript benchmarks that we have |
| 105 used to tune V8. The final score is computed as the geometric mean of | 105 used to tune V8. The final score is computed as the geometric mean of |
| 106 the individual results to make it independent of the running times of | 106 the individual results to make it independent of the running times of |
| 107 the individual benchmarks and of a reference system (score | 107 the individual benchmarks and of a reference system (score |
| 108 100). Scores are not comparable across benchmark suite versions and | 108 100). Scores are not comparable across benchmark suite versions and |
| 109 higher scores means better performance: <em>Bigger is better!</em> | 109 higher scores means better performance: <em>Bigger is better!</em> |
| 110 | 110 |
| 111 <ul> | 111 <ul> |
| 112 <li><b>Richards</b><br>OS kernel simulation benchmark, originally written in BCP
L by Martin Richards (<i>539 lines</i>).</li> | 112 <li><b>Richards</b><br>OS kernel simulation benchmark, originally written in BCP
L by Martin Richards (<i>539 lines</i>).</li> |
| 113 <li><b>DeltaBlue</b><br>One-way constraint solver, originally written in Smallta
lk by John Maloney and Mario Wolczko (<i>880 lines</i>).</li> | 113 <li><b>DeltaBlue</b><br>One-way constraint solver, originally written in Smallta
lk by John Maloney and Mario Wolczko (<i>880 lines</i>).</li> |
| 114 <li><b>Crypto</b><br>Encryption and decryption benchmark based on code by Tom Wu
(<i>1698 lines</i>).</li> | 114 <li><b>Crypto</b><br>Encryption and decryption benchmark based on code by Tom Wu
(<i>1698 lines</i>).</li> |
| 115 <li><b>RayTrace</b><br>Ray tracer benchmark based on code by <a href="http://flo
g.co.nz/">Adam Burmister</a> (<i>904 lines</i>).</li> | 115 <li><b>RayTrace</b><br>Ray tracer benchmark based on code by <a href="http://flo
g.co.nz/">Adam Burmister</a> (<i>904 lines</i>).</li> |
| 116 <li><b>EarleyBoyer</b><br>Classic Scheme benchmarks, translated to JavaScript by
Florian Loitsch's Scheme2Js compiler (<i>4684 lines</i>).</li> | 116 <li><b>EarleyBoyer</b><br>Classic Scheme benchmarks, translated to JavaScript by
Florian Loitsch's Scheme2Js compiler (<i>4684 lines</i>).</li> |
| 117 <li><b>RegExp</b><br>Regular expression benchmark generated by extracting regula
r expression operations from 50 of the most popular web pages | 117 <li><b>RegExp</b><br>Regular expression benchmark generated by extracting regula
r expression operations from 50 of the most popular web pages |
| 118 (<i>1761 lines</i>). | 118 (<i>1761 lines</i>). |
| 119 </li> | 119 </li> |
| 120 <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> | 120 <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> |
| 121 <li><b>NavierStokes (beta)</b><br>Solves NavierStokes equations in 2D, heavily m
anipulating double precision arrays. Based on Oliver Hunt's code (<i>396 lines</
i>).</li> | 121 <li><b>NavierStokes</b><br>Solves NavierStokes equations in 2D, heavily manipula
ting double precision arrays. Based on Oliver Hunt's code (<i>387 lines</i>).</l
i> |
| 122 </ul> | 122 </ul> |
| 123 | 123 |
| 124 <p> | 124 <p> |
| 125 Note that benchmark results are not comparable unless both results are | 125 Note that benchmark results are not comparable unless both results are |
| 126 run with the same revision of the benchmark suite. We will be making | 126 run with the same revision of the benchmark suite. We will be making |
| 127 revisions from time to time in order to fix bugs or expand the scope | 127 revisions from time to time in order to fix bugs or expand the scope |
| 128 of the benchmark suite. For previous revisions and the change log see | 128 of the benchmark suite. For previous revisions and the change log see |
| 129 the <a href="http://v8.googlecode.com/svn/data/benchmarks/current/revisions.html
">revisions</a> page. | 129 the <a href="http://v8.googlecode.com/svn/data/benchmarks/current/revisions.html
">revisions</a> page. |
| 130 </p> | 130 </p> |
| 131 | 131 |
| 132 </td><td style="text-align: center"> | 132 </td><td style="text-align: center"> |
| 133 <div class="run"> | 133 <div class="run"> |
| 134 <div id="status">Starting...</div> | 134 <div id="status">Starting...</div> |
| 135 <div id="results"> | 135 <div id="results"> |
| 136 </div> | 136 </div> |
| 137 </div> | 137 </div> |
| 138 </td></tr></table> | 138 </td></tr></table> |
| 139 | 139 |
| 140 </div> | 140 </div> |
| 141 | 141 |
| 142 </body> | 142 </body> |
| 143 </html> | 143 </html> |
| OLD | NEW |