Simulating Structural Plasticity of the Brain more Scalable than Expected

10/11/2022
by   Fabian Czappa, et al.
0

Structural plasticity of the brain describes the creation of new and the deletion of old synapses over time. Rinke et al. (JPDC 2018) introduced a scalable algorithm that simulates structural plasticity for up to one billion neurons on current hardware using a variant of the Barnes-Hut algorithm. They demonstrate good scalability and prove a runtime complexity of O(n log^2 n). In this comment paper, we show that with careful consideration of the algorithm and a rigorous proof, the theoretical runtime can even be classified as O(n log n).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/25/2023

Accelerating Brain Simulations with the Fast Multipole Method

The brain is probably the most complex organ in the human body. To under...
research
12/31/2021

Structural Liveness of Immediate Observation Petri Nets

We show that the structural liveness problem for immediate observation n...
research
04/07/2019

Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces

We give an algorithm that computes a (1+ϵ)-approximate Steiner forest in...
research
01/30/2023

Breadth-First Depth-Next: Optimal Collaborative Exploration of Trees with Low Diameter

We consider the problem of collaborative tree exploration posed by Fraig...
research
04/19/2021

A Choreographed Outline Instrumentation Algorithm for Asynchronous Components

The runtime analysis of decentralised software requires instrumentation ...
research
04/23/2020

Deterministic Sparse Sublinear FFT with Improved Numerical Stability

In this paper we extend the deterministic sublinear FFT algorithm for fa...

Please sign up or login with your details

Forgot password? Click here to reset