Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2022 Jun 17:16:882552.
doi: 10.3389/fninf.2022.882552. eCollection 2022.

Scaling and Benchmarking an Evolutionary Algorithm for Constructing Biophysical Neuronal Models

Affiliations

Scaling and Benchmarking an Evolutionary Algorithm for Constructing Biophysical Neuronal Models

Alexander Ladd et al. Front Neuroinform. .

Abstract

Single neuron models are fundamental for computational modeling of the brain's neuronal networks, and understanding how ion channel dynamics mediate neural function. A challenge in defining such models is determining biophysically realistic channel distributions. Here, we present an efficient, highly parallel evolutionary algorithm for developing such models, named NeuroGPU-EA. NeuroGPU-EA uses CPUs and GPUs concurrently to simulate and evaluate neuron membrane potentials with respect to multiple stimuli. We demonstrate a logarithmic cost for scaling the stimuli used in the fitting procedure. NeuroGPU-EA outperforms the typically used CPU based evolutionary algorithm by a factor of 10 on a series of scaling benchmarks. We report observed performance bottlenecks and propose mitigation strategies. Finally, we also discuss the potential of this method for efficient simulation and evaluation of electrophysiological waveforms.

Keywords: biophysical neuron model; electrophysiology; evolutionary algorithms; high performance computing; non-convex optimization; strong scaling; weak scaling.

PubMed Disclaimer

Conflict of interest statement

The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

Figures

Figure 1
Figure 1
Stimuli and electrophysiological score functions used in algorithm: (A) Various stimuli used in the fitting procedure of EA. (B) Corresponding target voltages that are recorded from patch clamp experiments as a result of the stimuli in (A). (C) Demonstrates how electrophysiological score functions are computed on a single trace. These score functions are used to compare target and simulated firing traces.
Figure 2
Figure 2
(A) Sequential execution EA. (B) CPU-EA maps the simulation/evaluation of a model to a single core. (C) GPU-EA maps each stimuli to a GPU, then scores the simulation in parallel on each CPU core. (D) Timeline of NeuroGPU-EA for two generations. The algorithm starts new stimuli on GPUs while the CPUs are still completing the previous ones.
Figure 3
Figure 3
Simulation-evaluation scaling CPU vs. GPU: Experiments measuring the time it takes to run one simulation-evaluation step using NeuroGPU-EA, CoreNeuron-EA, and CPU-EA. (A) One compute node and population size increases, as in Table 1. (B) Increases compute nodes and population size is constant, as in Table 2. (C) Increasing compute nodes and population size, as in Table 3.
Figure 4
Figure 4
GPU bottleneck shifts to CPU as population per node increases: at large population sizes the CPU operation for score functions is the bottleneck—denoted by relatively taller bars for CPU Eval. At smaller population sizes in (B) the GPU simulation is the bottleneck for CoreNeuron-EA—denoted by relatively taller bars for simulation. CPU and GPU time are balanced at small population sizes for NeuroGPU-EA in (A).
Figure 5
Figure 5
Scaling stimuli and electrophysiological scoring functions: Panel (A) represents the observed run time as the number of stimuli used in the algorithm increases. We provide two lines for scaling reference O(log(n)2) and O(log(n)4). Panel (B) represents the observed run time as the number of score functions used in the algorithm increases. We provide two lines for reference, O(n3) and O(log(n)4).
Figure 6
Figure 6
Best fitted model after 50 generations of EA using 8 stimuli and 20 score functions (red) plotted against experimental data (black). (A) Long square stimulus. (B) Short square stimulus. (C) Noisy stimulus. The remaining stimuli and scores are shown in Supplementary Figure 5 and Supplementary Table 1, respectively.
Figure 7
Figure 7
EA score and model fit both improve with larger population size: (A) Objective function optimization trajectory in EA with varying population sizes. Scores start around 2,500 but the y-axis is constrained to clearly show results. Lower scores indicate a closer fit to experimental data. The minima of the objective function are denoted by large circles and the lower the minima the more the best simulated response resembles the experimentally recorded waveform. Confidence intervals are computed using 10 random initializations. Panel (B) illustrates the neuron model responses corresponding to varying population sizes.

References

    1. Abi Akar N., Cumming B., Karakasis V., Küsters A., Klijn W., Peyser A., et al. (2019). “Arbor–a morphologically-detailed neural network simulation library for contemporary high-performance computing architectures,” in 2019 27th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP) (Pavia: IEEE; ), 274–282. 10.1109/EMPDP.2019.8671560 - DOI
    1. Almog M., Korngreen A. (2016). Is realistic neuronal modeling realistic? J. Neurophysiol. 116, 2180–2209. 10.1152/jn.00360.2016 - DOI - PMC - PubMed
    1. Amdahl G. M. (1967). “Validity of the single processor approach to achieving large scale computing capabilities,” in Proceedings of Spring Joint Computer Conference (New Jersey: ), 483–485. 10.1145/1465482.1465560 - DOI
    1. Bailey D. H., Lucas R. F., Williams S. (2010). Performance Tuning of Scientific Applications. Florida: CRC Press. 10.1201/b10509 - DOI
    1. Balasubramanian M., Ruiz T. D., Cook B., Prabhat M., Bhattacharyya S., Shrivastava A., et al. (2020). “Scaling of union of intersections for inference of granger causal networks from observational data,” in 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS) (Louisiana: IEEE; ), 264–273. 10.1109/IPDPS47924.2020.00036 - DOI