A COMPARISON OF PARALLEL IMPLEMENTATIONS OF PATHFINDING ALGORITHMS

dc.contributor.advisorPettey, Chrisila
dc.contributor.authorJohnson, Charles W
dc.contributor.committeememberSeo, Suk
dc.contributor.committeememberAderholdt, Ferrol
dc.date.accessioned2021-05-29T01:03:35Z
dc.date.available2021-05-29T01:03:35Z
dc.date.issued2021
dc.date.updated2021-05-29T01:03:35Z
dc.description.abstractPathfinding 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.description.degreeM.S.
dc.identifier.urihttps://jewlscholar.mtsu.edu/handle/mtsu/6449
dc.language.rfc3066en
dc.publisherMiddle Tennessee State University
dc.source.urihttp://dissertations.umi.com/mtsu:11449
dc.subjectParallel Processing
dc.subjectPathfinding Algorithms
dc.subjectComputer science
dc.thesis.degreelevelmasters
dc.titleA COMPARISON OF PARALLEL IMPLEMENTATIONS OF PATHFINDING ALGORITHMS

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Johnson_mtsu_0170N_11449.pdf
Size:
21.34 MB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
0 B
Format:
Item-specific license agreed upon to submission
Description:

Collections