Improved Computing Performance for Algorithm Finding the Shortest Path for all-pair in the MapReduce architectures

Abstract The problem of finding All Pair Shortest Path (APSP). APSP is performed on many structures such as: MPI, OpenMP, Cuda, …. When the input data is large, we need to find ways to improve computing power to reduce calculation time for the APSP algorithm. In this paper, we present a contribution for the All-Pair Shortest Path algorithm (APSP) in the MapReduce architectures. The MapReduce algorithm has two functions Map and Reduce. There receive key/value pairs based on an adjacency list. Algorithm perform in MapReduce and our results prove that the proposed approach improved Computing Performance for Algorithm Finding the Shortest Path for all-pair.