By Topic

A fast graph search multiprocessor algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Venkata Subramaniam, P.R. ; Dept. of Comput. Sci., Houston Univ., TX, USA ; Kam-Hoi Cheng

A systematic exploration of the vertices of a graph is the graph search problem. In this paper, we propose a new multiprocessor algorithm to solve the graph search problem. Our approach is to divide the work into three logical tasks, each carried out by a different group of processors. The first group processes the information of vertices. The second group balances the work-load among the first group of processors dynamically, and the third group processes the relationships among the vertices of the graph. They remove edges leading to processed vertices, thus eliminating the possibility of duplication of processing. Our proposed algorithm takes O(n/p+L) time using reconfigurable meshes with O(pl) processors, where n is the number of vertices, l the number of edges, and L is one plus the minimum distance of the furthest vertex from the start vertex. Our algorithm is faster than the parallel breadth-first search algorithm on a SIMD-SM-R model

Published in:

Aerospace and Electronics Conference, 1997. NAECON 1997., Proceedings of the IEEE 1997 National  (Volume:1 )

Date of Conference:

14-18 Jul 1997