Exploring PGAS-based Gossiping Algorithms for Kn δdel Graphs

Kn ddel graphs of even order n and degree 1 < d < log(2)(n), W-d,W-n,W- are regular graphs that have an underlying topology that is time optimal for algorithms gossiping among n nodes. Because of their distinctive properties, Kn ddel graphs act as a time-optimal topology for broadcasting and gossiping, thus arising in many settings, including social and communication networks or agent-based modeling simulations. Experimentation, often based on the extensive generation and analysis of complex networks, relies on high-performance computational resources to efficiently simulate the flow of information. The efficacy of such processing commonly depends on parallel processing and proper provisioning of distributed resources. This article aims to introduce a runtime in the partitioned global address space model that is optimized for performance and designed to improve the processing of Kn ddel graphs. The sequential and parallel generation of synthetic datasets, and simulation of push-based, and broadcast-based gossiping algorithms with detailed analysis of resource usage and runtime have been studied.