Dijkstra algorithm in parallel- Case study

Abstract

This article aims to highlight the usefulness of improving classical algorithms by generating new approaches, efficiency or parallel execution time optimization at all costs. The reconsideration of classical algorithms, but in different testing conditions can help all products that rely on them. Based on the different uses of Dijkstra's algorithm and the new approaches based on the use, it can be said that today this algorithm covers several areas with high utility nowadays. Here there are examples such as GPS systems, which must find roads fast depending on different conditions. Also this algorithm is to be found in the network where we can talk about real priority schemes and data transfer speed that matters a lot today. Even in the top management systems these algorithms, minimum road, can be used with predilection. This article offers an innovative and efficient approach of Dijkstra's algorithm through parallel programming and analysis of the results obtained in different tests.