Main content

A Comparative Analysis of the Performance of Scalable Parallel Patterns Applied to Genetic Algorithms and Configured for NVIDIA GPUs

Show simple item record

dc.contributor.advisor Calvert, Dave
dc.contributor.advisor Grewal, Gary
dc.contributor.author Radford, Dave
dc.date.accessioned 2016-06-15T17:41:57Z
dc.date.available 2016-06-15T17:41:57Z
dc.date.copyright 2016-06
dc.date.created 2016-06-09
dc.date.issued 2016-06-15
dc.identifier.uri http://hdl.handle.net/10214/9762
dc.description.abstract Parallel programming is becoming the norm for modern computer programming. In order to utilize system resources effectively, programmers can use programming patterns to improve their programs. Parallel programming patterns are built upon a foundation of serial programming patterns to maximize the efficiency of parallel code and effectively use parallel resources available in a given system. This thesis focuses on using NVIDIA GPUs with the CUDA C library for parallel computing. The goal is to successfully implement two parallel versions of a genetic algorithm using the Map and Fork-Join parallel patterns to improve its performance compared to an equivalent serial genetic algorithm. The intent is to demonstrate that the parallel patterns can be implemented successfully on the CUDA platform and achieve increases in speedup, efficiency, and scalability with the parallel genetic algorithms. A comparative assessment of the two parallel patterns is conducted by configuring them to evaluate instances of the Travelling Salesman Problem using four different datasets. This assessment considers each algorithm's runtime performance, their use of system resources, and the amount of parallel overhead they use. The results of this assessment are used to determine which parallel algorithm performed best. en_US
dc.language.iso en en_US
dc.rights Attribution 2.5 Canada *
dc.rights.uri http://creativecommons.org/licenses/by/2.5/ca/ *
dc.subject Parallel Patterns en_US
dc.subject Genetic Algorithms en_US
dc.subject Travelling Salesman Problem en_US
dc.subject Many-core devices en_US
dc.subject CUDA en_US
dc.subject Parallel Computing en_US
dc.title A Comparative Analysis of the Performance of Scalable Parallel Patterns Applied to Genetic Algorithms and Configured for NVIDIA GPUs en_US
dc.type Thesis en_US
dc.degree.programme Computer Science en_US
dc.degree.name Master of Science en_US
dc.degree.department School of Computer Science en_US
dc.rights.license All items in the Atrium are protected by copyright with all rights reserved unless otherwise indicated.


Files in this item

Files Size Format View
Radford_Dave_201606_Msc.pdf 1.890Mb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Attribution 2.5 Canada Except where otherwise noted, this item's license is described as Attribution 2.5 Canada