JEWLScholar@MTSU Repository

A COMPARISON OF PARALLEL IMPLEMENTATIONS OF PATHFINDING ALGORITHMS

Show simple item record

dc.contributor.advisor Pettey, Chrisila
dc.contributor.author Johnson, Charles W
dc.date.accessioned 2021-05-29T01:03:35Z
dc.date.available 2021-05-29T01:03:35Z
dc.date.issued 2021
dc.identifier.uri https://jewlscholar.mtsu.edu/handle/mtsu/6449
dc.description.abstract Pathfinding algorithms are in constant use today – be it for generating driving directions or maintaining the routing tables that are used for routing traffic around the Internet. As would be expected, a given algorithm’s performance varies depending upon both the type and the scale of the application. Additionally, the use of parallel computing techniques may or may not decrease the runtime for a given problem. This thesis examines three commonly used pathfinding algorithms – Dijkstra, Bellman-Ford, and Floyd-Warshall – and seeks to illustrate their strengths and weaknesses when analyzing graphs that range from small and sparse to large and dense in various parallel computing environments. As well, focus is given to the use of Graphics Processing Units (GPUs) as parallel computing devices themselves and the consequential reduction in the amount of hardware necessary for a given task.
dc.publisher Middle Tennessee State University
dc.source.uri http://dissertations.umi.com/mtsu:11449
dc.subject Parallel Processing
dc.subject Pathfinding Algorithms
dc.subject Computer science
dc.title A COMPARISON OF PARALLEL IMPLEMENTATIONS OF PATHFINDING ALGORITHMS
dc.date.updated 2021-05-29T01:03:35Z
dc.language.rfc3066 en
dc.contributor.committeemember Seo, Suk
dc.contributor.committeemember Aderholdt, Ferrol
dc.thesis.degreelevel masters
dc.description.degree M.S.


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search JEWLScholar@MTSU


Browse

My Account

Statistics