Going through rough times: From non-equilibrium surface growth to algorithmic scalability


Korniss G., Novotny M., Rikvold P., Guclu H. , Toroczkai Z.

Symposium on Combinatorial and Artificial Intelligence Methods in Materials Science held at the 2001 MRS Fall Meeting, Massachusetts, Amerika Birleşik Devletleri, 26 - 29 Kasım 2001, cilt.700, ss.297-308

  • Cilt numarası: 700
  • Basıldığı Şehir: Massachusetts
  • Basıldığı Ülke: Amerika Birleşik Devletleri
  • Sayfa Sayısı: ss.297-308

Özet

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 tune 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.