Improving the efficiency of graph algorithm executions on high‐performance computing

• DOI: 10.1002/cpe.7419
• Publication Date: 2022-11-02T06:10:24Z
• Authors: Marcelo K. Moori; Hiago Mayk G. de ...; Janaina Schwarzrock; Arthur F. Lorenzon; Antonio Carlos S....
• Keywords: Multi-core processor; Graph Algorithms

Summary The growing need for extracting information from large graphs has been pushing the development of parallel graph algorithms. However, highly irregular structure real‐world limits performance and energy improvements applications. In this paper, we show that, in most cases, using all available cores multiprocessor is not best option terms aforementioned non‐functional requirements. Based on propose GraphKat , a framework that enables simultaneous processing several algorithms/graphs instead executing them serially (i.e., one after another), increasing efficiency energy. works two steps: (i) it characterizes applications with specific number threads based their levels; (ii) defines execution order target system. Experimental results three multicore processors (Intel AMD) improves overall system's related to (up ) energy‐saving 245.21), reduces applications' time consumption 6.64) compared default HPC systems.