Synchronization Landscapes in Small-World-Connected Computer Networks

Motivated by a synchronization problem in distributed computing we studied a simple growth model on regular and small-world networks, embedded in one and two-dimensions. We find that the synchronization landscape (corresponding to the progress of the individual processors) exhibits Kardar-Parisi-Zhang-like kinetic roughening on regular networks with short-range communication links. Although the processors, on average, progress at a nonzero rate, their spread (the width of the synchronization landscape) diverges with the number of nodes (desynchronized state) hindering efficient data management. When random communication links are added on top of the one and two-dimensional regular networks (resulting in a small-world network), large fluctuations in the synchronization landscape are suppressed and the width approaches a finite value in the large system-size limit (synchronized state). In the resulting synchronization scheme, the processors make close-to-uniform progress with a nonzero rate without global intervention. We obtain our results by ``simulating the simulations", based on the exact algorithmic rules, supported by coarse-grained arguments.Comment: 20 pages, 22 figure

The Impact of Network Flows on Community Formation in Models of Opinion Dynamics

We study dynamics of opinion formation in a network of coupled agents. As the network evolves to a steady state, opinions of agents within the same community converge faster than those of other agents. This framework allows us to study how network topology and network flow, which mediates the transfer of opinions between agents, both affect the formation of communities. In traditional models of opinion dynamics, agents are coupled via conservative flows, which result in one-to-one opinion transfer. However, social interactions are often non-conservative, resulting in one-to-many transfer of opinions. We study opinion formation in networks using one-to-one and one-to-many interactions and show that they lead to different community structure within the same network.Comment: accepted for publication in The Journal of Mathematical Sociology. arXiv admin note: text overlap with arXiv:1201.238

Parallel and Distributed Simulation from Many Cores to the Public Cloud (Extended Version)

In this tutorial paper, we will firstly review some basic simulation concepts and then introduce the parallel and distributed simulation techniques in view of some new challenges of today and tomorrow. More in particular, in the last years there has been a wide diffusion of many cores architectures and we can expect this trend to continue. On the other hand, the success of cloud computing is strongly promoting the everything as a service paradigm. Is parallel and distributed simulation ready for these new challenges? The current approaches present many limitations in terms of usability and adaptivity: there is a strong need for new evaluation metrics and for revising the currently implemented mechanisms. In the last part of the paper, we propose a new approach based on multi-agent systems for the simulation of complex systems. It is possible to implement advanced techniques such as the migration of simulated entities in order to build mechanisms that are both adaptive and very easy to use. Adaptive mechanisms are able to significantly reduce the communication cost in the parallel/distributed architectures, to implement load-balance techniques and to cope with execution environments that are both variable and dynamic. Finally, such mechanisms will be used to build simulations on top of unreliable cloud services.Comment: Tutorial paper published in the Proceedings of the International Conference on High Performance Computing and Simulation (HPCS 2011). Istanbul (Turkey), IEEE, July 2011. ISBN 978-1-61284-382-

Olami-Feder-Christensen Model on different Networks

We investigate numerically the Self Organized Criticality (SOC) properties of the dissipative Olami-Feder-Christensen model on small-world and scale-free networks. We find that the small-world OFC model exhibits self-organized criticality. Indeed, in this case we observe power law behavior of earthquakes size distribution with finite size scaling for the cut-off region. In the scale-free OFC model, instead, the strength of disorder hinders synchronization and does not allow to reach a critical state.Comment: To appear in the Proceedings of 3rd NEXT International Conference "News Expectations and Trends in Statistical Physics" (13-18 August 2005, Kolimbari - Crete, Greece), as a special issue of the European Journal of Physics B and of the Physica A, by G. Kaniadakis, A. Carbone, M. Lissi

The Simulation Model Partitioning Problem: an Adaptive Solution Based on Self-Clustering (Extended Version)

This paper is about partitioning in parallel and distributed simulation. That means decomposing the simulation model into a numberof components and to properly allocate them on the execution units. An adaptive solution based on self-clustering, that considers both communication reduction and computational load-balancing, is proposed. The implementation of the proposed mechanism is tested using a simulation model that is challenging both in terms of structure and dynamicity. Various configurations of the simulation model and the execution environment have been considered. The obtained performance results are analyzed using a reference cost model. The results demonstrate that the proposed approach is promising and that it can reduce the simulation execution time in both parallel and distributed architectures

Suppressing Roughness of Virtual Times in Parallel Discrete-Event Simulations

In a parallel discrete-event simulation (PDES) scheme, tasks are distributed among processing elements (PEs), whose progress is controlled by a synchronization scheme. For lattice systems with short-range interactions, the progress of the conservative PDES scheme is governed by the Kardar-Parisi-Zhang equation from the theory of non-equilibrium surface growth. Although the simulated (virtual) times of the PEs progress at a nonzero rate, their standard deviation (spread) diverges with the number of PEs, hindering efficient data collection. We show that weak random interactions among the PEs can make this spread nondivergent. The PEs then progress at a nonzero, near-uniform rate without requiring global synchronizations

A characteristic particle method for traffic flow simulations on highway networks

A characteristic particle method for the simulation of first order macroscopic traffic models on road networks is presented. The approach is based on the method "particleclaw", which solves scalar one dimensional hyperbolic conservations laws exactly, except for a small error right around shocks. The method is generalized to nonlinear network flows, where particle approximations on the edges are suitably coupled together at the network nodes. It is demonstrated in numerical examples that the resulting particle method can approximate traffic jams accurately, while only devoting a few degrees of freedom to each edge of the network.Comment: 15 pages, 5 figures. Accepted to the proceedings of the Sixth International Workshop Meshfree Methods for PDE 201

Lyapunov Functions Family Approach to Transient Stability Assessment

Analysis of transient stability of strongly nonlinear post-fault dynamics is one of the most computationally challenging parts of Dynamic Security Assessment. This paper proposes a novel approach for assessment of transient stability of the system. The approach generalizes the idea of energy methods, and extends the concept of energy function to a more general Lyapunov Functions Family (LFF) constructed via Semi-Definite-Programming techniques. Unlike the traditional energy function and its variations, the constructed Lyapunov functions are proven to be decreasing only in a finite neighborhood of the equilibrium point. However, we show that they can still certify stability of a broader set of initial conditions in comparison to the traditional energy function in the closest-UEP method. Moreover, the certificates of stability can be constructed via a sequence of convex optimization problems that are tractable even for large scale systems. We also propose specific algorithms for adaptation of the Lyapunov functions to specific initial conditions and demonstrate the effectiveness of the approach on a number of IEEE test cases