Please use this identifier to cite or link to this item:
Title: Parallel graph algorithm
Authors: Nguyen, Duc Hieu.
Keywords: DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
Issue Date: 2012
Abstract: This report records the author’s work during the project’s period. This project will study parallel graph algorithm for solving graph based problem. It will research the shortest path problems and all shortest path problems. The author studied some well-known algorithms such as Dijiskstra algorithm and Floyd algorithm. They have been studied in sequential, parallel with shared memory and distributed memory. After that the author ran a benchmark for Floyd algorithm with distributed memory to analyze it further. After studied the shortest path problems, the author came up with a new approach which used Floyd algorithm in order to reduce the number of cycles which needs to complete the calculation for all shortest path problem. The author applied the knowledge about parallel processing and graph problem to complete the study. The report highlights what the author did and learnt during the final year project’s period.
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
  Restricted Access
Final Year Report483.32 kBAdobe PDFView/Open

Page view(s)

checked on Sep 29, 2020


checked on Sep 29, 2020

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.