Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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. >
['Ouri Wolfson', 'Weining Zhang', 'Harish Butani', 'Akira Kawaguchi', 'Kui W. Mok']
I am writing a research paper on a idea A methodology for evaluating parallel graph algorithms and its application to single source reachability
[{"from": "human", "value": "I am writing a research paper on a idea A methodology for evaluating parallel graph algorithms and its application to single source reachability"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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. >"}]