Communication Sparsity in Distributed Spiking Neural Network Simulations to Improve Scalability

• Main Authors: Carlos Fernandez-Musoles, Daniel Coca, Paul Richmond
• Format: Article
• Language: English
• Published: Frontiers Media S.A. 2019-04-01
• Series: Frontiers in Neuroinformatics
• Subjects: Spiking Neural Networks; distributed simulation; hypergraph partitioning; dynamic sparse data exchange; HPC
• Online Access: https://www.frontiersin.org/article/10.3389/fninf.2019.00019/full

In the last decade there has been a surge in the number of big science projects interested in achieving a comprehensive understanding of the functions of the brain, using Spiking Neuronal Network (SNN) simulations to aid discovery and experimentation. Such an approach increases the computational demands on SNN simulators: if natural scale brain-size simulations are to be realized, it is necessary to use parallel and distributed models of computing. Communication is recognized as the dominant part of distributed SNN simulations. As the number of computational nodes increases, the proportion of time the simulation spends in useful computing (computational efficiency) is reduced and therefore applies a limit to scalability. This work targets the three phases of communication to improve overall computational efficiency in distributed simulations: implicit synchronization, process handshake and data exchange. We introduce a connectivity-aware allocation of neurons to compute nodes by modeling the SNN as a hypergraph. Partitioning the hypergraph to reduce interprocess communication increases the sparsity of the communication graph. We propose dynamic sparse exchange as an improvement over simple point-to-point exchange on sparse communications. Results show a combined gain when using hypergraph-based allocation and dynamic sparse communication, increasing computational efficiency by up to 40.8 percentage points and reducing simulation time by up to 73%. The findings are applicable to other distributed complex system simulations in which communication is modeled as a graph network.