Location of Repository

Nonequilibrium Surface Growth and Scalability of Parallel Algorithms for Large Asynchronous Systems

By G. Korniss, M. A. Novotny, Z. Toroczkai and P. A. Rikvold

Abstract

Abstract. The scalability of massively parallel algorithms is a fundamental question in computer science. We study the scalability and the efficiency of a conservative massively parallel algorithm for discrete-event simulations where the discrete events are Poisson arrivals. The parallel algorithm is applicable to a wide range of problems, including dynamic Monte Carlo simulations for large asynchronous systems with short-range interactions. The evolution of the simulated time horizon is analogous to a growing and fluctuating surface, and the efficiency of the algorithm corresponds to the density of local minima of this surface. In one dimension we find that the steady state of the macroscopic landscape is governed by the Edwards-Wilkinson Hamiltonian, which implies that the algorithm is scalable. Preliminary results for higher-dimensional logical topologies are discussed.

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.305.7009
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://arxiv.org/pdf/cond-mat/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.