Algorithmic scalability in globally constrained conservative parallel discrete event simulations of asynchronous systems

Abstract

We consider parallel simulations for asynchronous systems employing L processing elements that are arranged on a ring. Processors communicate only among the nearest neighbors and advance their local simulated time only if it is guaranteed that this does not violate causality. In simulations with no constraints, in the infinite L-limit the utilization scales (Korniss et al, PRL 84, 2000); but, the width of the virtual time horizon diverges (i.e., the measurement phase of the algorithm does not scale). In this work, we introduce a moving window global constraint, which modifies the algorithm so that the measurement phase scales as well. We present results of systematic studies in which the system size (i.e., L and the volume load per processor) as well as the constraint are varied. The constraint eliminates the extreme fluctuations in the virtual time horizon, provides a bound on its width, and controls the average progress rate. The width of the window constraint can serve as a tuning parameter that, for a given volume load per processor, could be adjusted to optimize the utilization so as to maximize the efficiency. This result may find numerous applications in modeling the evolution of general spatially extended short-range interacting systems with asynchronous dynamics, including dynamic Monte Carlo studies.

14 pages, 11 figures

References in corpus (5)

• Dynamic Phase Transition, Universality, and Finite-size Scaling in the Two-dimensional Kinetic Ising Model in an Oscillating Field
• Absence of First-order Transition and Tri-critical Point in the Dynamic Phase Diagram of a Spatially Extended Bistable System in an Oscillating Field
• From Massively Parallel Algorithms and Fluctuating Time Horizons to Non-equilibrium Surface Growth
• Parallelization of a Dynamic Monte Carlo Algorithm: a Partially Rejection-Free Conservative Approach
• Extremal-point Densities of Interface Fluctuations

Cited by in corpus (9)

• Synchronization Landscapes in Small-World-Connected Computer Networks
• Roughening of the (1+1) interfaces in two-component surface growth with an admixture of random deposition
• On the Evolution of Time Horizons in Parallel and Grid Simulations
• Update statistics in conservative parallel discrete event simulations of asynchronous systems
• Virtual Time Horizon Control via Communication Network Design
• Diffusion Processes on Small-World Networks with Distance-Dependent Random-Links
• Synchronization in Small-World-Connected Computer Networks
• Desynchronization and Speedup in an Asynchronous Conservative Parallel Update Protocol
• Cellular automata with majority rule on evolving network