Graphics Processor Unit (GPU) are general purpose stream processor capable of very high computation and data throughput. In certain applications requiring massive vector operations, this can yield several orders of magnitude higher performance than a conventional CPU.
This task comprises of parallel implementation of Floyd-Warshall algorithm using CUDA. Floyd-Warshall algorithm is used to find shortest path in weighted graph. This task should be implemented by matrix-matrix multiplication approach and using CUBLAS library functions (if possible).
The design has to be optimized in terms of throughput and latency requirements.
Prerequisites: C programming.
Prerequisites: C programming.
Contact: Muhammad Kashif Hanif
No comments:
Post a Comment