Abstract: Large graphs with millions and even billions of vertices are found in many real-life network analysis, the processing of which is challenging. One of the toughest tasks is computing the average shortest path length in a large network, which requires a lot of memory and processing time while calculating many independent paths. Hence, this task becomes a good candidate for parallelizing. The idea of using graphics processing units (GPUs) for general purpose computing is not new, and with recent increases in performances and memory capacity, they ...
(read more)
Topics: 
Parallel computing
Theoretical computer science
Algorithm