Suppressing Roughness of Virtual Times in Parallel Discrete-Event Simulations

Simple item page
dc.creatorKorniss, G.
dc.creatorNovotny, M. A.
dc.creatorGuclu, H.
dc.creatorToroczkai, Z.
dc.creatorRikvold, P. A.
dc.date2003-02-03
dc.date.accessioned2026-07-07T02:49:30Z
dc.date.available2026-07-07T02:49:30Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/cond-mat/0302050
dc.identifierhttp://arxiv.org/abs/cond-mat/0302050
dc.identifierScience 299, 677 (2003)
dc.identifierdoi:10.1126/science.1079382
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/20822
dc.subjectStatistical Mechanics
dc.subjectDisordered Systems and Neural Networks
dc.subjectDistributed, Parallel, and Cluster Computing
dc.subjectComputational Physics
dc.titleSuppressing Roughness of Virtual Times in Parallel Discrete-Event Simulations
dc.typetext

Files

Collections

arXiv