A methodology for evaluating parallel graph algorithms and its application to single source reachability

The authors consider parallel processing of a graph represented by a database relation. They propose a methodology for analyzing the speedup of a parallel processing strategy with the purpose of selecting at run-time one of several candidate strategies, depending on the hardware architecture and the input graph. They study the single-source reachability problem, namely, the problem of computing the set of nodes reachable from a given node in a selected graph, propose several parallel strategies for solving this problem, and analyze their performance using the new methodology. The analysis is confirmed experimentally in a UNIX-Ethernet environment.<
>