Implementation of batch merge sort algorithm, based on the article of O. Green et al., 2013. For simplification, we only consider the case of power of 2 arrays. We test different versions for comparaison : one version on CPU and two versions on GPU (with and without shared memory). For the last one, we use all the memory capacity for each block so for this one, we need to only consider arrays of size Batch-merge-sort.cu
, we take a batch of vector and sort them on GPU ; in Batch-cpu-gpu.cu
, we compare speed of CPU and GPU versions and finally in Comparaison-shared.cu
, we compare speed of version with/without shared memory.
-
Notifications
You must be signed in to change notification settings - Fork 0
Arnautt/Batch-merge-sort-cuda-cpp
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published