Facebook pixel tracking

The Science and Information (SAI) Organization publishes open-access peer-reviewed journals in computer science and artificial intelligence.

Contact Info
Website thesai.org
Follow Us
Contact Info
Follow Us
Research Article | Open Access |

Parallel BFS for Large-Scale Graph Processing and Smart Device Computing Frameworks

Author 1: Esra’a Alhenawi Author 2: Abdulla Aburomman Author 3: Omar Alidmat Author 4: Hebatullah Khattab
International Journal of Advanced Computer Science and Applications (IJACSA) · Vol. 17, No. 10 · Published 2026

DOI: 10.14569/IJACSA.2026.0171093

Abstract

Large-scale graph processing and analysis have become crucial problems in the big data era, affecting a variety of fields like social networks, road, and web networks. Traditional Breadth-First Search (BFS) algorithms frequently scale inefficiently due to memory constraints and computational bottlenecks. This paper presents a parallel version of the BFS (PBFS) algorithm using two different frameworks, Hadoop/MapReduce, and concurrency. Performance has been evaluated over graphs of different sizes based on runtime, speedup, efficiency, and cost metrics. This paper provides practical guidelines for selecting appropriate graph processing frameworks depending on graph size and system architecture. The results indicate that increasing the number of cores improves speedup but reduces efficiency due to overhead and resource contention. For small and medium sized datasets, BFS implemented with a concurrency framework on a single machine outperforms Hadoop MapReduce because communication overhead is negligible and total execution time depends mainly on computation. In addition, from a computing standpoint of a smart device, single core and dual core configurations represent a constrained environment for IoT and edge devices, which suggests that the concurrency model will be an efficient PBFS solution for this type of environment. In contrast, for large-scale datasets, Hadoop MapReduce achieves better performance by efficiently distributing computation across multiple nodes.

Keywords

How to Cite this Article

Alhenawi, E., Aburomman, A., Alidmat, O., & Khattab, H. (2026). Parallel BFS for Large-Scale Graph Processing and Smart Device Computing Frameworks. International Journal of Advanced Computer Science and Applications, 17(10). https://doi.org/10.14569/IJACSA.2026.0171093

Alhenawi, Esra’a, et al.. "Parallel BFS for Large-Scale Graph Processing and Smart Device Computing Frameworks." International Journal of Advanced Computer Science and Applications, vol. 17, no. 10, 2026, https://doi.org/10.14569/IJACSA.2026.0171093.

@article{Alhenawi2026,
  title     = {Parallel BFS for Large-Scale Graph Processing and Smart Device Computing Frameworks},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {17},
  number    = {10},
  year      = {2026},
  publisher = {The Science and Information Organization},
  author    = {Esra’a Alhenawi and Abdulla Aburomman and Omar Alidmat and Hebatullah Khattab},
  doi       = {10.14569/IJACSA.2026.0171093},
  url       = {https://doi.org/10.14569/IJACSA.2026.0171093}
}

Open Access — licensed under a Creative Commons Attribution 4.0 International License. Unrestricted use, distribution, and reproduction in any medium, even commercially, as long as the original work is properly cited.

Call for Papers - Important Dates

Volume 17 No. 12, December 2026
Paper Submission Due November 25, 2026
Review Notification December 15, 2026
Publication Date December 31, 2026