Anil K. Singh

Work place: CSED, MNNIT Allahabad, Prayagraj (India)

E-mail: asbhadoria@gmail.com

Website:

Research Interests: Requirements Analysis, Software Organization and Properties, Computer Architecture and Organization, Data Structures and Algorithms, Mathematical Analysis

Biography

Dr. Anil K. Singh is a professor at Computer Science and Engineering Department of Motilal Nehru Institute of Technology Allahabad, Prayagraj, India. He has completed his Ph.D. from IIT Roorkee. He has teaching experience of more than 18 years. His area of interest includes semantic analysis, graph processing and big data and cloud computing. He has published papers in different national, international conferences and journals. Several masters and Ph.D. scholars are currently working under his supervision.

Author Articles
MapReduce Algorithm for Single Source Shortest Path Problem

By Praveen Kumar Anil K. Singh

DOI: https://doi.org/10.5815/ijcnis.2020.03.02, Pub. Date: 8 Jun. 2020

Computing single source shortest path is a popular problem in graph theory, extensively applied in many areas like computer networks, operation research and complex network analysis. SSSP is difficult to parallelize efficiently as more parallelization leads to more work done by any algorithm. MapReduce is a popular programming framework for large data processing in distributed and cloud environments. In this paper, we have proposed MR-DSMR, a Map reduce version of Dijkstra Strip-mined Relaxation (DSMR) algorithm and MR3-BFS algorithms. We have compared the performance of both the algorithms with BFS. It is observed that MR-DSMR takes lesser communication and computation time compared to existing algorithms.

[...] Read more.
Other Articles