Physics – Condensed Matter – Statistical Mechanics
Scientific paper
2001-12-06
Materials Research Society Symposium Proceedings Series Vol. 700, pp. 297-308, 2002
Physics
Condensed Matter
Statistical Mechanics
to appear in the Proceedings of the MRS, Fall 2001
Scientific paper
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.
Guclu Hasan
Korniss Gyorgy
Novotny Mark A.
Rikvold Per Arne
Toroczkai Zoltan
No associations
LandOfFree
Going through Rough Times: from Non-Equilibrium Surface Growth to Algorithmic Scalability does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Going through Rough Times: from Non-Equilibrium Surface Growth to Algorithmic Scalability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Going through Rough Times: from Non-Equilibrium Surface Growth to Algorithmic Scalability will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-325804