A Parallel Floyd-Warshall algorithm based on TBB

Abstract

The paper presents one novel algorithms: Parallel Floyd-Warshall algorithm(PF) based on multi-core computer with Threading Building Blocks (TBB). TBB offers a rich and complete approach to express parallelism in a C++ program. Serial Floyd-Warshall algorithm(SF) and PF are implemented and verified with TBB for the all-pairs shortest path problem. Experiments show that the efficiency of multi-threaded of PF is obviously superior to single-threaded of PF which is enormously better than SF. At this point, PF can be efficiently applied to the systems of large node number and it leads to a significant improvement in running efficiency. Furthermore, the running results of multi-threaded of PF are stable when thread number is relatively large.