HXTSort

view on GitLab

view on gitlab
HXTSortHextreme 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.

Paper: Robust and efficient validation of the linear hexahedral element

We present a method to compute the true validity of hexahedra in an efficient manner. More than 6 million hexahedra are analyzed on a single core per second.

Johnen, Amaury, Jean-Christophe Weil et Jean-François Remacle. « Robust and Efficient Validation of Linear Hexahedral Elements », dans 26th International Meshing Roundtable, Barcelona, Spain, 2017.

First paper: Combination of tetrahedra in hexahedra

We developed a method to very efficiently combine the elements of a tetrahedral mesh into hexahedra.  The new vertex based algorithm builds all the feasible potential hexahedra  under given quality constraints. Around 3 millions of potential hexahedra are generated in 10 seconds. A greedy combination is used to compute the final hex-dominant mesh.