avcourt/task-parallelism-omp
A comparison of task-level constructs available in OpenMP by analyzing the performance of well known divide-and-conquer sorting algorithms: Quicksort and Mergesort.
CMIT
No issues in this repository yet.
A comparison of task-level constructs available in OpenMP by analyzing the performance of well known divide-and-conquer sorting algorithms: Quicksort and Mergesort.
CMIT
No issues in this repository yet.