Rapid development of parallel blocked all-pairs shortest paths code for multi-core computers

In this paper, we present the rapid development of efficient multi-core parallel code for the blocked Floyd-Warshall algorithm, using the C++ library gae.h [4], on top of the Intel C++ Threading Building Blocks (TBB) library. We demonstrate that developing parallel multi-core code using gae.h is easy and fast. The parallel code developed with gae.h is also efficient. The efficiency of the parallel code developed for the blocked Floyd-Warshall algorithm on an 80-core HP ProLiant DL980 G7 multi-core machine is above 70% if less than 70 cores are used and above 90% if less than 20 cores are used.