Skip to content
Snippets Groups Projects
Commit 50d83931 authored by Nikolay Shirokovskiy's avatar Nikolay Shirokovskiy Committed by Dmitry Ivanov
Browse files

core: introduce sample sort algorithm

The algorithm runs sort in multiple threads and does not use OpenMP. It
has better threads utilization right from the beginning but probably
a worse constant than parallel qsort. See details in code comments.

Besides sort is not performed in calling thread but instead in spawned
worker threads. Calling thread yields waiting for worker threads to
finish. Exception is small data size, in this case sorting is executed
in calling thread saving time on spawning a thread. This should speed up
test execution. This is existing behaviour of qsort_arg but data size
threshold is reduced from 128000 to 1024.

Part of #3389

NO_CHANGELOG=internal
NO_DOC=internal
parent 8eb86462
No related branches found
No related tags found
1 merge request!111Remove libgomp from dependencies
Loading
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment