jzubairi@rodan.acs.syr.edu (Junaid Ahmed Zubairi) (12/27/90)
Has anyone worked on implementing parallel search algorithms on SIMD environment. I am specially interested in knowing about the scheme of depth first search. What I have is a scheme in which all nodes in a graph trace their links recursively to do the search. The search is carried out in steps during which all nodes using visit and link flags to one particular node go depth-first into the embedded tree. But this scheme does not look too efficient. Thanks Junaid ZUbairi