A New Approach of Performance Analysis of Certain Graph Algorithms
Faculty of Engineering and IT, University of Technology Sydney (UTS), Sydney, Australia
International Journal of Advanced Research in Computer and Communication Engineering, Vol. 2, Issue 9, 2013
@article{mridha2013new,
title={A New Approach of Performance Analysis of Certain Graph Algorithms},
author={Mridha, MF and Islam, Mohammad Manzurul and Rahman, Syed Mohammad Oliur},
year={2013}
}
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.
October 26, 2013 by hgpu
