Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  present a parallelization of the Floyd-Warshall all pairs shortest path algorithm for a distributed environment. A lot of versions of the Floyd-Warshall algorithm have been proposed for a uniprocessor environment, optimizing cache performance and register usage. Hover, in a distributed environment, communication costs beten nodes have to be taken into consideration.  present a novel algorithm, Phased Floyd-Warshall, for a distributed environment, which optimally overlaps computation and communication. Our algorithm is compared with a register optimized version of the blocked all pairs shortest path algorithm [6, 4, 1] which is adapted for a distributed environment.  report speedups of 2.8 in a 16-node cluster and 1.2 in a 32-node cluster for a matrix size of 4096.
['T. Srinivasan', 'B.R. Gangadharan', 'S. A. Gangadharan', 'V. Hayawardh']
I am writing a research paper on a idea A scalable parallelization of all-pairs shortest path algorithm for a high performance cluster environment
[{"from": "human", "value": "I am writing a research paper on a idea A scalable parallelization of all-pairs shortest path algorithm for a high performance cluster environment"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  present a parallelization of the Floyd-Warshall all pairs shortest path algorithm for a distributed environment. A lot of versions of the Floyd-Warshall algorithm have been proposed for a uniprocessor environment, optimizing cache performance and register usage. Hover, in a distributed environment, communication costs beten nodes have to be taken into consideration.  present a novel algorithm, Phased Floyd-Warshall, for a distributed environment, which optimally overlaps computation and communication. Our algorithm is compared with a register optimized version of the blocked all pairs shortest path algorithm [6, 4, 1] which is adapted for a distributed environment.  report speedups of 2.8 in a 16-node cluster and 1.2 in a 32-node cluster for a matrix size of 4096."}]