sort – Hextreme https://www.hextreme.eu Hexahedral Mesh Generation in Real Time Wed, 07 Nov 2018 10:06:53 +0000 en-US hourly 1 https://www.hextreme.eu/wp-content/uploads/2018/11/cropped-erc-1-32x32.jpg sort – Hextreme https://www.hextreme.eu 32 32 HXTSort https://www.hextreme.eu/hxtsort/ https://www.hextreme.eu/hxtsort/#respond Tue, 05 Sep 2017 13:50:39 +0000 http://www.hextreme.eu/?p=1683 Continue reading HXTSort]]> view on GitLab

view on gitlab
HXTSort – Hextreme Sorting Library

HXTSort is a single header library including lightning fast Parallel Radix Sort macros.

It can sort 400 million integers per second on a laptop’s  i7-6700HQ and up to 1 billion integers per second on a Intel® Xeon Phi™  7210 ( 1.30GHz).

 

HXTSort is a lot faster than qsort
Because HXTSORT32_UNIFORM does not always pick the best underlying algorithm on the core i7, we manually chose the best of LSB32 and PARALLEL_HYBRID32.

It includes multiple  key-based algorithms for sorting data on any standard computer (single-node SMPs). It could also be a very good core algorithm for a MPI merge sort implementation for Clusters.

HXTSort will be used in our future Mesh Generation Library. A version of this library containing only a basic Mesher will be released soon.

]]> https://www.hextreme.eu/hxtsort/feed/ 0