TU Darmstadt / ULB / TUprints

Scalability Validation of Parallel Sorting Algorithms

Berens, Yannick (2017)
Scalability Validation of Parallel Sorting Algorithms.
Technische Universität
Bachelor Thesis, Primary publication

Bachelor Thesis - Text (PDF)
Berens_Scalability_Thesis.pdf - Submitted Version
Copyright Information: CC BY-NC-ND 4.0 International - Creative Commons, Attribution NonCommercial, NoDerivs.

Download (1MB) | Preview
Item Type: Bachelor Thesis
Type of entry: Primary publication
Title: Scalability Validation of Parallel Sorting Algorithms
Language: English
Referees: Wolf, Prof. Dr. Felix ; Shudler, Sergei
Date: 16 October 2017
Place of Publication: Darmstadt
Date of oral examination: 30 October 2017

As single-core performance of processors is not improving significantly anymore, the computer industry is moving towards increasing the amount of cores per processor or, in the case of large-scale computers, by installing more processors per computer. Applications now need to scale in accordance with the increase of parallel computing power and software developers need to take advantage of this movement. And parallel sorting algorithms present basic building blocks for many complex applications. In this thesis, we will validate the expected execution time complexities of five state-of-the-art parallel sorting algorithms, implemented in C using MPI for parallelization, by using a scalability validation framework based on Score-P and Extra-P. For each of the parallel sorting algorithms, we will create a performance model. These models will allow us to compare their scalability behaviour to the expectations. Furthermore, we will attempt to parallelize the local sorting step of the splitter-based parallel sorting algorithms via C++11 threads, OpenMP tasks, and CUDA acceleration. We construct the performance models, on which we base our evaluations, using uniformly randomly generated data. For most of the parallel sorting algorithms, we show that the given expectations match the created models. We will discuss any other discrepancies in detail.

URN: urn:nbn:de:tuda-tuprints-68259
Divisions: 20 Department of Computer Science > Parallel Programming
Date Deposited: 26 Oct 2017 10:15
Last Modified: 09 Jul 2020 01:52
URI: https://tuprints.ulb.tu-darmstadt.de/id/eprint/6825
Actions (login required)
View Item View Item