A study about differences in performance with parallel and sequential sorting algorithms
Background: Sorting algorithms are an essential part of computer science. With the use of parallelism, these algorithms performance can improve. Objectives: To assess parallel sorting algorithms performance compared with their sequential counterparts and see what contextual factors make a difference...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Blekinge Tekniska Högskola, Institutionen för programvaruteknik
2021
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:bth-21469 |