1<html> 2<head> 3<meta http-equiv="Content-Type" content="text/html; charset=UTF-8"> 4<title>Complex (Several Types)</title> 5<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> 6<meta name="generator" content="DocBook XSL Stylesheets V1.79.1"> 7<link rel="home" href="../../../index.html" title="Boost.Sort"> 8<link rel="up" href="../windows_single.html" title="2.6.- Windows Benchmarks"> 9<link rel="prev" href="../windows_single.html" title="2.6.- Windows Benchmarks"> 10<link rel="next" href="../../parallel.html" title="3.- Parallel Algorithms"> 11</head> 12<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> 13<table cellpadding="2" width="100%"><tr> 14<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> 15<td align="center"><a href="../../../../../../../index.html">Home</a></td> 16<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> 17<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> 18<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> 19<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> 20</tr></table> 21<hr> 22<div class="spirit-nav"> 23<a accesskey="p" href="../windows_single.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../windows_single.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../parallel.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> 24</div> 25<div class="section"> 26<div class="titlepage"><div><div><h4 class="title"> 27<a name="sort.single_thread.windows_single.complex_benchmarks"></a><a class="link" href="complex_benchmarks.html" title="Complex (Several Types)">Complex 28 (Several Types)</a> 29</h4></div></div></div> 30<div class="blockquote"><blockquote class="blockquote"> 31<p> 32 The next results are obtained from more complex benchmarks, not include 33 in the library because they use non free SW (If you are interested in 34 the details, contact fjtapia@gmail.com) 35 </p> 36<p> 37 There are 3 types of benchmarks, 38 </p> 39<div class="blockquote"><blockquote class="blockquote"> 40<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "> 41<li class="listitem"> 42 64 bits integers 43 </li> 44<li class="listitem"> 45 strings 46 </li> 47<li class="listitem"> 48 objects of several sizes. 49 </li> 50</ul></div> 51<p> 52 The objects are arrays of integers. The heavy comparison sums all the 53 elements in each, and the light comparison uses only the first number 54 of the array. 55 </p> 56</blockquote></div> 57<h5> 58<a name="sort.single_thread.windows_single.complex_benchmarks.h0"></a> 59 <span class="phrase"><a name="sort.single_thread.windows_single.complex_benchmarks.100_000_000_numbers_of_64_bits_r"></a></span><a class="link" href="complex_benchmarks.html#sort.single_thread.windows_single.complex_benchmarks.100_000_000_numbers_of_64_bits_r"><span class="underline">100 000 000 Numbers of 64 bits Randomly Filled</span></a> 60 </h5> 61<p> 62 <span class="bold"><strong> 63<pre class="programlisting"> | | | 64 | | Maximum | 65 | Time ( secs) | Memory Used | 66----------------------+--------------+--------------+ 67 std::sort | 12.381 | 783 MB | 68 pdqsort | 9.760 | 783 MB | 69 | | | 70 std::stable_sort | 13.311 | 1174 MB | 71 spinsort | 11.541 | 1174 MB | 72 flat_stable_sort | 13.664 | 787 MB | 73 spreadsort | 8.507 | 783 MB | 74 | | | 75</pre> 76 </strong></span> 77 </p> 78<h5> 79<a name="sort.single_thread.windows_single.complex_benchmarks.h1"></a> 80 <span class="phrase"><a name="sort.single_thread.windows_single.complex_benchmarks.10_000_000_strings_randomly_fill"></a></span><a class="link" href="complex_benchmarks.html#sort.single_thread.windows_single.complex_benchmarks.10_000_000_strings_randomly_fill"><span class="underline">10 000 000 Strings Randomly Filled</span></a> 81 </h5> 82<p> 83 <span class="bold"><strong> 84<pre class="programlisting"> | | | 85 | | Maximum | 86 | Time ( secs) | Memory Used | 87----------------------+--------------+--------------+ 88 std::sort | 9.658 | 885 MB | 89 pdqsort | 15.247 | 1605 MB | 90 | | | 91 std::stable_sort | 19.753 | 1041 MB | 92 spinsort | 17.596 | 1041 MB | 93 flat_stable_sort | 19.159 | 887 MB | 94 spreadsort | 5.221 | 885 MB | 95 | | | 96</pre> 97 </strong></span> 98 </p> 99<h5> 100<a name="sort.single_thread.windows_single.complex_benchmarks.h2"></a> 101 <span class="phrase"><a name="sort.single_thread.windows_single.complex_benchmarks.objects_randomly_filled"></a></span><a class="link" href="complex_benchmarks.html#sort.single_thread.windows_single.complex_benchmarks.objects_randomly_filled"><span class="underline">Objects Randomly Filled</span></a> 102 </h5> 103<div class="blockquote"><blockquote class="blockquote"> 104<p> 105 The objects are arrays of 64 bits numbers 106 </p> 107<p> 108 They are compared in two ways : 109 </p> 110<div class="blockquote"><blockquote class="blockquote"> 111<p> 112 (H) Heavy : The comparison is the sum of all the numbers of the array. 113 </p> 114<p> 115 (L) Light : The comparison is using only the first element of the 116 array, as a key 117 </p> 118</blockquote></div> 119</blockquote></div> 120<p> 121 <span class="bold"><strong> 122<pre class="programlisting"> | | | | | | | | 123 | 100000000 | 50000000 | 25000000 | 12500000 | 6250000 | 1562500 | | 124 | objects of| objects of| objects of| objects of| objects of| objects of| Maximum | 125 | 8 bytes | 16 bytes | 32 bytes | 64 bytes | 128 bytes | 512 bytes | Memory | 126 | | | | | | | Used | 127 | H L | H L | H L | H L | H L | H L | | 128-----------------+-----------+-----------+-----------+-----------+-----------+-----------+-------------+ 129std::sort |11.86 12.00| 6.53 6.10| 3.85 3.21| 2.79 1.97| 3.17 1.37| 2.04 1.30| 783 MB | 130pdqsort | 9.80 9.39| 5.39 4.98| 3.11 2.51| 2.14 1.61| 2.50 1.10| 1.92 1.03| 783 MB | 131 | | | | | | | | 132std::stable_sort |12.91 13.58| 7.73 7.32| 5.16 4.52| 4.22 3.67| 4.31 3.18| 3.46 2.89| 1174 MB | 133spinsort |11.58 11.37| 6.88 6.40| 4.43 3.76| 3.58 3.06| 3.84 2.41| 2.76 2.17| 1174 MB | 134flat_stable_sort |13.31 13.87| 8.35 7.83| 5.32 4.46| 4.16 3.14| 3.63 2.27| 2.67 2.13| 787 MB | 135spreadsort | 8.37 8.37| 6.51 6.62| 3.72 3.16| 2.75 1.69| 2.56 1.20| 1.38 0.80| 783 MB | 136 | | | | | | | | 137</pre> 138 </strong></span> 139 </p> 140</blockquote></div> 141</div> 142<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> 143<td align="left"></td> 144<td align="right"><div class="copyright-footer">Copyright © 2014-2017 Steven 145 Ross, Francisco Tapia, Orson Peters<p> 146 Distributed under the <a href="http://boost.org/LICENSE_1_0.txt" target="_top">Boost 147 Software License, Version 1.0</a>. 148 </p> 149</div></td> 150</tr></table> 151<hr> 152<div class="spirit-nav"> 153<a accesskey="p" href="../windows_single.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../windows_single.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../parallel.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> 154</div> 155</body> 156</html> 157
