high performance computing on graphics processing units: hgpu.org

Computer Network based problems often require searching a node from another and finding a path from one node to another. To solve this we use graph algorithms. Solving these problems takes a lot of time and knowledge when solved manually. For this purpose graph algorithms where devised and solving these problems became easier but the time taken to solve these problems using the algorithms sequentially takes a lot of time. So to make the time consumed to be less we devised the parallel version of these algorithms and tested. In this paper, we present a new parallel Prim algorithm targeting SMP with shared address space.