Title :
A methodology for evaluating parallel graph algorithms and its application to single source reachability
Author :
Wolfson, Ouri ; Zhang, Weining ; Butani, Harish ; Kawaguchi, Akira ; Mok, Kui
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Illinois Univ., Chicago, IL, USA
Abstract :
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
Keywords :
database theory; distributed databases; parallel algorithms; query processing; spatial data structures; UNIX-Ethernet; database relation; hardware architecture; input graph; parallel graph algorithms; parallel processing; single source reachability; Bills of materials; Computer architecture; Computer science; Concurrent computing; Databases; Hardware; Mathematics; Parallel processing; Performance analysis; Runtime;
Conference_Titel :
Parallel and Distributed Information Systems, 1993., Proceedings of the Second International Conference on
Conference_Location :
San Diego, CA
Print_ISBN :
0-8186-3330-1
DOI :
10.1109/PDIS.1993.253087
