Lines Matching refs:sorting

4 HotSort is a high-performance GPU-accelerated integer sorting library
9 * Ultra-fast sorting of 32‑bit or 64‑bit keys
11 * In-place sorting for low-memory environments
18 implementations when sorting arrays of smaller than 500K-2M keys.
24 Here is a throughput plot for HotSort on Vulkan and CUDA sorting
40 Note that these sorting rates translate to sub-millisecond to
52 Note that HotSort is a comparison sort and supports in-place sorting.
100 hs_vk_ds_bind(hs,hs_ds,cb,vin,vout); // or (...,vin,VK_NULL_HANDLE) for in-place sorting
154 hs_cuda_sort_u32(vin,vout, // or (vin,NULL,...) for in-place sorting
198 hs_cl_sort(hs,cq,...,vin,vout,...); // or (...,vin,NULL,...) for in-place sorting
212 The HotSort sorting algorithm was created in 2012 and generalized in
216 possible on small GPUs when sorting modestly-sized arrays ― 1,000s to
249 sorting algorithm that loads a "slab" of keys into a subgroup's
253 In the slab sorting phase, each lane of a subgroup executes a bitonic
254 sorting network on its registers and successively merges lanes until
279 HotSort's initial sorting and merging phases are performed on bitonic