From Massively Parallel Algorithms and Fluctuating Time Horizons to Nonequilibrium Surface Growth
- 7 February 2000
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 84 (6) , 1351-1354
Abstract
We study the asymptotic scaling properties of a massively parallel algorithm for discrete-event simulations where the discrete events are Poisson arrivals. The evolution of the simulated time horizon is analogous to a nonequilibrium surface. Monte Carlo simulations and a coarse-grained approximation indicate that the macroscopic landscape in the steady state is governed by the Edwards-Wilkinson Hamiltonian. Since the efficiency of the algorithm corresponds to the density of local minima in the associated surface, our results imply that the algorithm is asymptotically scalable.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- PARALLEL INVADED CLUSTER ALGORITHM FOR THE ISING MODELInternational Journal of Modern Physics C, 1999
- Fractal Concepts in Surface Growth1995
- The cost of conservative synchronization in parallel discrete event simulationsJournal of the ACM, 1993
- Parallel discrete event simulationCommunications of the ACM, 1990
- Efficient parallel simulations of dynamic Ising spin systemsJournal of Computational Physics, 1988
- Time-reversal invariance and universality of two-dimensional growth modelsPhysical Review B, 1987
- Nonuniversal critical dynamics in Monte Carlo simulationsPhysical Review Letters, 1987
- Ballistic deposition on surfacesPhysical Review A, 1986
- The surface statistics of a granular aggregateProceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 1982
- Test of the Monte Carlo Method: Fast Simulation of a Small Ising LatticeThe Journal of Chemical Physics, 1970