Suppressing Roughness of Virtual Times in Parallel Discrete-Event Simulations

Abstract

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.

Cited by in corpus (26)

• Synchronization in complex networks
• Universality in the synchronization of weighted random networks
• Synchronization is optimal in non-diagonalizable networks
• Maximum Performance at Minimum Cost in Network Synchronization
• Synchronization transition in scale-free networks: Clusters of synchrony
• Naming Games in Two-Dimensional and Small-World-Connected Random Geometric Networks
• Synchronization in Weighted Uncorrelated Complex Networks in a Noisy Environment: Optimization and Connections with Transport Efficiency
• Enhancing synchronizability of weighted dynamical networks using betweenness centrality
• Hierarchical, Regular Small-World Networks
• Efficient Rewirings for Enhancing Synchronizability of Dynamical Networks
• Diffusion Processes on Power-Law Small-World Networks
• Testing the Collective Properties of Small-World Networks through Roughness Scaling
• Scaling in Small-World Resistor Networks
• Extreme Fluctuations in Small-Worlds with Relaxational Dynamics
• The Impact of Competing Time Delays in Coupled Stochastic Systems
• Extreme fluctuations in noisy task-completion landscapes on scale-free networks
• Simulations of Large-scale WiFi-based Wireless Networks: Interdisciplinary Challenges and Applications
• Complex Networks: Time-Dependent Connections and Silent Nodes
• Update statistics in conservative parallel discrete event simulations of asynchronous systems
• Naming Games in Spatially-Embedded Random Networks
• Discrete-Event Analytic Technique for Surface Growth Problems
• Optimization in task--completion networks
• Diffusion Processes on Small-World Networks with Distance-Dependent Random-Links
• Threshold-Controlled Global Cascading in Wireless Sensor Networks
• Desynchronization and Speedup in an Asynchronous Conservative Parallel Update Protocol
• Multiscaling in the YX model of networks