Going through rough times : from non-equilibrium surface growth to algorithmic scalability /.
- Gyorgy
- Zoltan
Efficient and faithful parallel simulation of large asynchronous systems is a challenging computational problem. It requires using the concept of local simulated times and a synchronization scheme. We study the scalability of massively parallel algorithms for discrete-event simulations which employ conservative synchronization to enforce causality. We do this by looking at the simulated time horizon as a complex evolving system, and we identify its universal characteristics. We find that the time horizon for the conservative parallel discrete-event simulation scheme exhibits Kardar-Parisi-Zhang-like kinetic roughening. This implies that the algorithm is asymptotically scalable in the sense that the average progress rate of the simulation approaches a non-zero constant. It also implies, however, that there are diverging memory requirements associated with such schemes.
- Research Organization:
- Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
- Sponsoring Organization:
- USDOE
- OSTI ID:
- 975895
- Report Number(s):
- LA-UR-01-6631; TRN: US201018%%981
- Resource Relation:
- Journal Volume: 701; Conference: Submitted to: Materials Research Society Symposium Proceedings, Statistical Mechanical Modeling in Materials Research, Fall 2001, Boston, MA
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallelization of a dynamic Monte Carlo algorithm: A partially rejection-free conservative approach
GVT Algorithms and Discrete Event Dynamics on 128K+ Processor Cores