Combining Speedup Techniques based on Landmarks and Containers with parallelised preprocessing in Random and Planar Graphs

Abstract

The Dijkstra’s algorithm is applied in many real world problems like mobile routing, road maps, railway networks, etc,. There are many techniques available to speedup the algorithm while guaranteeing the optimality of the solution. Almost all of the speedup techniques have a substantial amount of parallelism that can be exploited to decrease its running time. By suitably modifying portions of the existing system various degrees of parallelism can be achieved. The rapidly growing field of multiprocessing systems and multi-core processors provide many opportunities for such improvements. In these techniques there’s always a demand for the running time and the time required for pre-processing. Space requirements for the pre-processing also have a major influence on the running time of the algorithm. The main focus of the work is to implement landmark technique and to identify the segment of the code in landmark pre-processing which can be parallelized to obtain better speedup. The results are applied to the combined speedup technique which is based on landmarks and containers. The experimental results were compared and analysed for determining better performance improvements in random graphs and planar graphs.