Optimization of Large-Scale Graph Processing with Advanced Partitioning and Thread Grouping
International Journal of Innovations in Science and Technology · 18.07.2026 · 1639
DOI: 10.33411/ijist/1944 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Innovations in Science and Technology, online erschienen am 18.07.2026. Verfasst von Muhammad Numan und 4 weiteren Autor:innen. Die Arbeit nennt 36 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Large-scale graphs are a natural way of modeling entities with complex relationships. Irregular structures and relationships complicate the processing of these large-scale graphs. Partitioning enables efficient processing of these graphs; however, it may result in information loss and imbalanced workload distribution. The processing of large graphs is greatly limited by these challenges, as they make it difficult to scale and efficiently process them. This paper provides a large-scale graph processing framework that involves graph partitioning and thread grouping to enhance memory usage and computational efficiency of a GPU-based system. The proposed partitioning algorithm creates subgraphs with minimum cross-partitions and minimum cross-partition edges. A thread grouping algorithm efficiently processes these partitions in parallel, minimizing inter-partition connectivity. It creates an execution pack of partitions that can be efficiently processed on a GPU at runtime based on available memory, while allowing hardware resources to be used elastically. The GraphSAGE architecture is used to evaluate the framework with several real-world benchmark datasets, such as OGBN-Products, Reddit, and LiveJournal. The experimental findings indicate that the proposed execution strategy achieves a substantial decrease in memory pressure and preserves competitive classification accuracy. The proposed work provides better stability and scalability of training without compromising the performance of the model, which is well-suited for the efficient processing of large-scale graphs.
Zitieren
APA
Numan, M., Malik, A. H., Ali, Q. E., Rehman, W. U., & Haseeb, M. (2026). Optimization of Large-Scale Graph Processing with Advanced Partitioning and Thread Grouping. International Journal of Innovations in Science and Technology, 1639. https://doi.org/10.33411/ijist/1944
Vancouver
Numan M, Malik AH, Ali QE, Rehman WU, Haseeb M. Optimization of Large-Scale Graph Processing with Advanced Partitioning and Thread Grouping. International Journal of Innovations in Science and Technology. 2026:1639. doi:10.33411/ijist/1944
BibTeX
@article{Numan2026,
author = {Numan, Muhammad and Malik, Abdul Haseeb and Ali, Qazi Ejaz and Rehman, Waheed Ur and Haseeb, Muhammad},
title = {Optimization of Large-Scale Graph Processing with Advanced Partitioning and Thread Grouping},
journal = {International Journal of Innovations in Science and Technology},
year = {2026},
pages = {1639},
doi = {10.33411/ijist/1944}
}
EUVIMED