Large-Scale Graph Processing Analysis using Supercomputer Cluster

International Conference on Computing and Applied Informatics 2016

物理学;计算机科学

Vildario, Alfrido^1 ; Fitriyani^1 ; Nugraha Nurkahfi, Galih^1

Department of Computational Science, Telkom University, West Java, Bandung, Indonesia^1

关键词: Breadth first search algorithms;    Computational science;    High performance computing;    Large-scale Graph;    Message passing interface;    Parallel;    Shortest path;    Shortest path problem;   

Others  :  https://iopscience.iop.org/article/10.1088/1742-6596/801/1/012079/pdf
DOI  :  10.1088/1742-6596/801/1/012079

学科分类：计算机科学（综合）

来源: IOP

【 摘 要 】

Graph implementation is widely use in various sector such as automotive, traffic, image processing and many more. They produce graph in large-scale dimension, cause the processing need long computational time and high specification resources. This research addressed the analysis of implementation large-scale graph using supercomputer cluster. We impelemented graph processing by using Breadth-First Search (BFS) algorithm with single destination shortest path problem. Parallel BFS implementation with Message Passing Interface (MPI) used supercomputer cluster at High Performance Computing Laboratory Computational Science Telkom University and Stanford Large Network Dataset Collection. The result showed that the implementation give the speed up averages more than 30 times and eficiency almost 90%.