guest ::
| Home > Publications database > A scalable algorithm for simulating the structural plasticity of the brain > print |
| Home > Publications database > A scalable algorithm for simulating the structural plasticity of the brain > print |
| 001 | 844224 | ||
| 005 | 20210129232828.0 | ||
| 024 | 7 | _ | |a 10.1016/j.jpdc.2017.11.019 |2 doi |
| 024 | 7 | _ | |a 0743-7315 |2 ISSN |
| 024 | 7 | _ | |a 1096-0848 |2 ISSN |
| 024 | 7 | _ | |a WOS:000442193100021 |2 WOS |
| 037 | _ | _ | |a FZJ-2018-01665 |
| 041 | _ | _ | |a English |
| 082 | _ | _ | |a 004 |
| 100 | 1 | _ | |a Rinke, Sebastian |0 0000-0002-1171-9024 |b 0 |e Corresponding author |
| 245 | _ | _ | |a A scalable algorithm for simulating the structural plasticity of the brain |
| 260 | _ | _ | |a Amsterdam [u.a.] |c 2017 |b Elsevier |
| 336 | 7 | _ | |a article |2 DRIVER |
| 336 | 7 | _ | |a Output Types/Journal article |2 DataCite |
| 336 | 7 | _ | |a Journal Article |b journal |m journal |0 PUB:(DE-HGF)16 |s 1570523534_4590 |2 PUB:(DE-HGF) |
| 336 | 7 | _ | |a ARTICLE |2 BibTeX |
| 336 | 7 | _ | |a JOURNAL_ARTICLE |2 ORCID |
| 336 | 7 | _ | |a Journal Article |0 0 |2 EndNote |
| 520 | _ | _ | |a The neural network in the brain is not hard-wired. Even in the mature brain, new connections between neurons are formed and existing ones are deleted, which is called structural plasticity. The dynamics of the connectome is key to understanding how learning, memory, and healing after lesions such as stroke work. However, with current experimental techniques even the creation of an exact static connectivity map, which is required for various brain simulations, is very difficult. One alternative is to use network models to simulate the evolution of synapses between neurons based on their specified activity targets. This is particularly useful as experimental measurements of the spiking frequency of neurons are more easily accessible and reliable than biological connectivity data. The Model of Structural Plasticity (MSP) by Butz and van Ooyen is an example of this approach. However, to predict which neurons connect to each other, the current MSP model computes probabilities for all pairs of neurons, resulting in a complexity . To enable large-scale simulations with millions of neurons and beyond, this quadratic term is prohibitive. Inspired by hierarchical methods for solving -body problems in particle physics, we propose a scalable approximation algorithm for MSP that reduces the complexity to without any notable impact on the quality of the results. We show that an MPI-based parallel implementation of our scalable algorithm can simulate the structural plasticity of up to neurons—four orders of magnitude more than the naïve version. |
| 536 | _ | _ | |a 511 - Computational Science and Mathematical Methods (POF3-511) |0 G:(DE-HGF)POF3-511 |c POF3-511 |f POF III |x 0 |
| 536 | _ | _ | |a SMHB - Supercomputing and Modelling for the Human Brain (HGF-SMHB-2013-2017) |0 G:(DE-Juel1)HGF-SMHB-2013-2017 |c HGF-SMHB-2013-2017 |f SMHB |x 1 |
| 536 | _ | _ | |a Scalable Performance Analysis of Large-Scale Parallel Applications (jzam11_20091101) |0 G:(DE-Juel1)jzam11_20091101 |c jzam11_20091101 |f Scalable Performance Analysis of Large-Scale Parallel Applications |x 2 |
| 536 | _ | _ | |a SLNS - SimLab Neuroscience (Helmholtz-SLNS) |0 G:(DE-Juel1)Helmholtz-SLNS |c Helmholtz-SLNS |x 3 |
| 588 | _ | _ | |a Dataset connected to CrossRef |
| 700 | 1 | _ | |a Butz-Ostendorf, Markus |0 P:(DE-HGF)0 |b 1 |
| 700 | 1 | _ | |a Hermanns, Marc-André |0 P:(DE-Juel1)168253 |b 2 |
| 700 | 1 | _ | |a Naveau, Mikael |0 P:(DE-Juel1)157988 |b 3 |
| 700 | 1 | _ | |a Wolf, Felix |0 P:(DE-HGF)0 |b 4 |
| 773 | _ | _ | |a 10.1016/j.jpdc.2017.11.019 |g p. S0743731517303313 |0 PERI:(DE-600)1469781-6 |p 251-266 |t Journal of parallel and distributed computing |v 120 |y 2017 |x 0743-7315 |
| 856 | 4 | _ | |u https://juser.fz-juelich.de/record/844224/files/1-s2.0-S0743731517303313-main.pdf |y Restricted |
| 856 | 4 | _ | |u https://juser.fz-juelich.de/record/844224/files/1-s2.0-S0743731517303313-main.pdf?subformat=pdfa |x pdfa |y Restricted |
| 909 | C | O | |p VDB |o oai:juser.fz-juelich.de:844224 |
| 910 | 1 | _ | |a Forschungszentrum Jülich |0 I:(DE-588b)5008462-8 |k FZJ |b 2 |6 P:(DE-Juel1)168253 |
| 910 | 1 | _ | |a Forschungszentrum Jülich |0 I:(DE-588b)5008462-8 |k FZJ |b 3 |6 P:(DE-Juel1)157988 |
| 913 | 1 | _ | |a DE-HGF |b Key Technologies |1 G:(DE-HGF)POF3-510 |0 G:(DE-HGF)POF3-511 |2 G:(DE-HGF)POF3-500 |v Computational Science and Mathematical Methods |x 0 |4 G:(DE-HGF)POF |3 G:(DE-HGF)POF3 |l Supercomputing & Big Data |
| 914 | 1 | _ | |y 2018 |
| 915 | _ | _ | |a JCR |0 StatID:(DE-HGF)0100 |2 StatID |b J PARALLEL DISTR COM : 2015 |
| 915 | _ | _ | |a DBCoverage |0 StatID:(DE-HGF)0200 |2 StatID |b SCOPUS |
| 915 | _ | _ | |a DBCoverage |0 StatID:(DE-HGF)0300 |2 StatID |b Medline |
| 915 | _ | _ | |a DBCoverage |0 StatID:(DE-HGF)0600 |2 StatID |b Ebsco Academic Search |
| 915 | _ | _ | |a Peer Review |0 StatID:(DE-HGF)0030 |2 StatID |b ASC |
| 915 | _ | _ | |a DBCoverage |0 StatID:(DE-HGF)0199 |2 StatID |b Thomson Reuters Master Journal List |
| 915 | _ | _ | |a WoS |0 StatID:(DE-HGF)0110 |2 StatID |b Science Citation Index |
| 915 | _ | _ | |a DBCoverage |0 StatID:(DE-HGF)0150 |2 StatID |b Web of Science Core Collection |
| 915 | _ | _ | |a WoS |0 StatID:(DE-HGF)0111 |2 StatID |b Science Citation Index Expanded |
| 915 | _ | _ | |a DBCoverage |0 StatID:(DE-HGF)1160 |2 StatID |b Current Contents - Engineering, Computing and Technology |
| 915 | _ | _ | |a IF < 5 |0 StatID:(DE-HGF)9900 |2 StatID |
| 920 | _ | _ | |l yes |
| 920 | 1 | _ | |0 I:(DE-82)080012_20140620 |k JARA-HPC |l JARA - HPC |x 0 |
| 920 | 1 | _ | |0 I:(DE-Juel1)JSC-20090406 |k JSC |l Jülich Supercomputing Center |x 1 |
| 980 | _ | _ | |a journal |
| 980 | _ | _ | |a VDB |
| 980 | _ | _ | |a I:(DE-82)080012_20140620 |
| 980 | _ | _ | |a I:(DE-Juel1)JSC-20090406 |
| 980 | _ | _ | |a UNRESTRICTED |
| Library | Collection | CLSMajor | CLSMinor | Language | Author |
|---|