Efficient Event-Driven Simulation of Large Networks of Spiking Neurons and Dynamical Synapses

2000 ◽  
Vol 12 (10) ◽  
pp. 2305-2329 ◽  
Author(s):  
Maurizio Mattia ◽  
Paolo Del Giudice

A simulation procedure is described for making feasible large-scale simulations of recurrent neural networks of spiking neurons and plastic synapses. The procedure is applicable if the dynamic variables of both neurons and synapses evolve deterministically between any two successive spikes. Spikes introduce jumps in these variables, and since spike trains are typically noisy, spikes introduce stochasticity into both dynamics. Since all events in the simulation are guided by the arrival of spikes, at neurons or synapses, we name this procedure event-driven. The procedure is described in detail, and its logic and performance are compared with conventional (synchronous) simulations. The main impact of the new approach is a drastic reduction of the computational load incurred upon introduction of dynamic synaptic efficacies, which vary organically as a function of the activities of the pre- and postsynaptic neurons. In fact, the computational load per neuron in the presence of the synaptic dynamics grows linearly with the number of neurons and is only about 6% more than the load with fixed synapses. Even the latter is handled quite efficiently by the algorithm. We illustrate the operation of the algorithm in a specific case with integrate-and-fire neurons and specific spike-driven synaptic dynamics. Both dynamical elements have been found to be naturally implementable in VLSI. This network is simulated to show the effects on the synaptic structure of the presentation of stimuli, as well as the stability of the generated matrix to the neural activity it induces.

2003 ◽  
Vol 15 (3) ◽  
pp. 565-596 ◽  
Author(s):  
Daniel J. Amit ◽  
Gianluigi Mongillo

The collective behavior of a network, modeling a cortical module of spiking neurons connected by plastic synapses is studied. A detailed spike-driven synaptic dynamics is simulated in a large network of spiking neurons, implementing the full double dynamics of neurons and synapses. The repeated presentation of a set of external stimuli is shown to structure the network to the point of sustaining working memory (selective delay activity). When the synaptic dynamics is analyzed as a function of pre- and postsynaptic spike rates in functionally defined populations, it reveals a novel variation of the Hebbian plasticity paradigm: in any functional set of synapses between pairs of neurons (e.g., stimulated—stimulated, stimulated—delay, stimulated—spontaneous), there is a finite probability of potentiation as well as of depression. This leads to a saturation of potentiation or depression at the level of the ratio of the two probabilities. When one of the two probabilities is very high relative to the other, the familiar Hebbian mechanism is recovered. But where correlated working memory is formed, it prevents overlearning. Constraints relevant to the stability of the acquired synaptic structure and the regimes of global activity allowing for structuring are expressed in terms of the parameters describing the single-synapse dynamics. The synaptic dynamics is discussed in the light of experiments observing precise spike timing effects and related issues of biological plausibility.


2006 ◽  
Vol 18 (12) ◽  
pp. 2959-2993 ◽  
Author(s):  
Eduardo Ros ◽  
Richard Carrillo ◽  
Eva M. Ortigosa ◽  
Boris Barbour ◽  
Rodrigo Agís

Nearly all neuronal information processing and interneuronal communication in the brain involves action potentials, or spikes, which drive the short-term synaptic dynamics of neurons, but also their long-term dynamics, via synaptic plasticity. In many brain structures, action potential activity is considered to be sparse. This sparseness of activity has been exploited to reduce the computational cost of large-scale network simulations, through the development of event-driven simulation schemes. However, existing event-driven simulations schemes use extremely simplified neuronal models. Here, we implement and evaluate critically an event-driven algorithm (ED-LUT) that uses precalculated look-up tables to characterize synaptic and neuronal dynamics. This approach enables the use of more complex (and realistic) neuronal models or data in representing the neurons, while retaining the advantage of high-speed simulation. We demonstrate the method's application for neurons containing exponential synaptic conductances, thereby implementing shunting inhibition, a phenomenon that is critical to cellular computation. We also introduce an improved two-stage event-queue algorithm, which allows the simulations to scale efficiently to highly connected networks with arbitrary propagation delays. Finally, the scheme readily accommodates implementation of synaptic plasticity mechanisms that depend on spike timing, enabling future simulations to explore issues of long-term learning and adaptation in large-scale networks.


2006 ◽  
Vol 14 (01) ◽  
pp. 1-19 ◽  
Author(s):  
ISAAC HARARI ◽  
RADEK TEZAUR ◽  
CHARBEL FARHAT

One-dimensional analyses provide novel definitions of the Galerkin/least-squares stability parameter for quadratic interpolation. A new approach to the dispersion analysis of the Lagrange multiplier approximation in discontinuous Galerkin methods is presented. A series of computations comparing the performance of [Formula: see text] Galerkin and GLS methods with Q-8-2 DGM on large-scale problems shows superior DGM results on analogous meshes, both structured and unstructured. The degradation of the [Formula: see text] GLS stabilization on unstructured meshes may be a consequence of inadequate one-dimensional analysis used to derive the stability parameter.


2019 ◽  
Vol 491 (2) ◽  
pp. 2919-2938 ◽  
Author(s):  
Thomas Berlok ◽  
Rüdiger Pakmor ◽  
Christoph Pfrommer

ABSTRACT We present a method for efficiently modelling Braginskii viscosity on an unstructured, moving mesh. Braginskii viscosity, i.e. anisotropic transport of momentum with respect to the direction of the magnetic field, is thought to be of prime importance for studies of the weakly collisional plasma that comprises the intracluster medium (ICM) of galaxy clusters. Here, anisotropic transport of heat and momentum has been shown to have profound consequences for the stability properties of the ICM. Our new method for modelling Braginskii viscosity has been implemented in the moving mesh code arepo. We present a number of examples that serve to test the implementation and illustrate the modified dynamics found when including Braginskii viscosity in simulations. These include (but are not limited to) damping of fast magnetosonic waves, interruption of linearly polarized Alfvén waves by the firehose instability, and the inhibition of the Kelvin–Helmholtz instability by Braginskii viscosity. An explicit update of Braginskii viscosity is associated with a severe time-step constraint that scales with (Δx)2, where Δx is the grid size. In our implementation, this restrictive time-step constraint is alleviated by employing second-order accurate Runge–Kutta–Legendre super-time-stepping. We envision including Braginskii viscosity in future large-scale simulations of Kelvin–Helmholtz unstable cold fronts in cluster mergers and AGN-generated bubbles in central cluster regions.


2007 ◽  
Vol 49 (5) ◽  
Author(s):  
Andreas Binzenhöfer ◽  
Phuoc Tran-Gia ◽  
Holger Schnabel

SummaryStructured peer-to-peer (p2p) networks are highly distributed systems with a potential to support business applications. There are numerous different suggestions on how to implement such systems. However, before legal p2p systems can become mainstream they need to offer improved efficiency, robustness, and stability. While Chord is the most researched and best understood mechanism, the Kademlia algorithm is widely-used in deployed applications. There are still many open questions concerning the performance of the latter. In this paper we identify the main problems of Kademlia by large scale simulations and present modifications which help to avoid those problems. This way, we are able to significantly improve the performance and robustness of Kademlia-based applications, especially in times of churn and in unstable states. In particular, we show how to increase the stability of the overlay, make searches more efficient, and adapt the maintenance traffic to the current churn rate in a self-organizing way.


2020 ◽  
Vol 10 (2) ◽  
pp. 5570-5575
Author(s):  
B. M. Alshammari

Reliability and performance quality measures computed so far are deterministic in nature. They represent one operating state (a snapshot of the system conditions) in which the required demand and generation and transmission capacities are known with 100% certainty. In this paper, a general and coherent formulation is presented, which can be used to account for the randomness associated with the load level as well as the availability of generation and transmission capacities. The general probability formulation can be used to calculate various reliability indices and quality measures. The paper describes the new approach for computing probabilistic evaluation (expected value) of the reliability indices and performance quality measures and presents illustrative applications. The methodology used in this paper constitutes a new line of research in the probabilistic reliability evaluation of a system where the derived system-wide performance quality indices are capable of classifying and exhibitionistic areas of deficiencies, bottlenecks and redundancies in large-scale power grids.


Sign in / Sign up

Export Citation Format

Share Document