In this paper we consider parallel processing of a graph represented by a database relation, and we achieved two objectives. First, we propose a methodology for analyzing the speedup of a parallel processing strategy with the purpose of selecting at runtime one of several candidate strategies, depending on the hardware architecture and the input graph. Second, we study the singlesource reachability problem, namely the problem of computing the set of nodes reachable from a given node in a directed graph. We propose several parallel strategies for solving this problem, and we analyze their performance using our new methodology. The analysis is confirmed experimentally in a UNIXEthernet environment. We also extend the results to the transitive closure problem.
In this paper we consider parallel processing of a graph represented by a database relation, and we achieved t w o objectives. First, we propose a methodology f o r 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. Second, we study the single-source reachability problem, namely the problem of computing the set of nodes reachable f r o m a given node in a directed graph. W e propose several parallel strategies f o r solving this problem, and we analyze their performance using our new methodology. The analysis is confirmed experimentally in a UNIX-E t h ern et environment.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.