Programming Parallel Computers 2020

Exercise SO: sorting

Individual tasks

Please see the grading tool for details on benchmark instances and time limits.

SO4: merge sort

Implement an efficient parallel sorting algorithm for the CPU, using the basic idea of merge sort.

Deadline week 4. Maximum points 5 + 1, after deadline 3 + 1. Participates in the contest.

SO5: quicksort

Implement an efficient parallel sorting algorithm for the CPU, using the basic idea of quicksort.

Deadline week 5. Maximum points 5 + 1, after deadline 3 + 1. Participates in the contest.

SO6: fast GPU solution

Implement an efficient parallel sorting algorithm for the GPU. Any sorting algorithm is fine, but radix sort is perhaps the simplest choice.

Deadline week 6. Maximum points 5 + 1. Participates in the contest.