Boost logo

Boost :

Subject: Re: [boost] [SORT] Parallel Algorithms
From: Francisco José Tapia (fjtapia_at_[hidden])
Date: 2015-03-29 06:25:12

Hi Steven

 Thanks by your message.

 Until now , I had been focused mainly in the algorithms, and I didn't
dedicate many time to others things as the test format and the integration
with boost::sort.Now, the first things to do are :

   - Try to detect when the data are ordered,
   - Revise in deep your library and code , in order to adapt the test and
   benchmarks to the procedures used in your library

 About the object used in the benchmarks, we can do something simple.
Reburcio is a very small class in the file
Benchmarks/GCC/algorithm/reburcio.hpp. Please rewrite and send me, and only
need to recompile the benchmarks.

 *About the parts to include*

 With the parallel unstable sort, all the algorithms I examined have the
same approach, and due this, similar performances. The range of decision is

 The goal is provide algorithms independent of any library or Operating
System, fast , robust and easy to use. The idea of to do the same than a
company is the origin of many Free SW, think about Oracle and MySQL,
Internet Explorer and Firefox. Even the C++ standard, is to do the same
than many companies are doing since many years ago, each with its own way.
The final users are grateful because simplify our work.

 TBB is available in Windows, Linux and Os X. With others operating system
( by example Android and all the real time OS), you must recompile all the
source code, and I have not clear about the dynamic linking of TBB in these
operating systems. Many small machines don't have task scheduler, but have
threads. To force to recompile TBB for to use a parallel sort is like force
to rent a bus, for to transport only one person.

Our code have similar performance, small code, independent of any Operating
System, of any other code or library. If you are C++11 compliant you have
parallel sort. I think, we must include sort, parallel sort, stable sort
and parallel stable sort. Perhaps, too, sample sort, but it's less

 Now I am beginning to examine your code for to integrate the new code with
the boost sort approach.



Boost list run by bdawes at, gregod at, cpdaniel at, john at