The ultimate bead counter: efficient massively parallel simulation of ballistic deposition

  • Authors:
  • Boris D. Lubachevsky;Vladimir Privman;Subhas C. Roy

  • Affiliations:
  • AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ;Department of Physics, Clarkson Univercity, Potsdam, NY;Department of Computer Science, College of William and Mary, Williamsburg, VA

  • Venue:
  • PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

We simulate ballistic particle deposition wherein a large number of spherical particles are “dropped” vertically over a planar horizontal surface. Upon first contact (with the surface or with a previously deposited particle) each particle stops. This model helps material scientists to study the adsorption and sediment formation [1]. The model is sequential, with particles deposited one by one. We have found an equivalent formulation using a continuous time random process and we simulate the latter in parallel using a method similar to the one previously employed for simulating Ising spins [2]. We augment the parallel algorithm for simulating Ising spins with several techniques aimed at the increase of efficiency of producing the particle configuration and statistics collection. Some of these techniques are similar to [3], [4], [5]. We implement the resulting algorithm on a 16K PE MasPar MP-1 and a 4K PE MasPar MP-2. The parallel code runs on MasPar computers two orders of magnitude faster than an optimized sequential code runs on a fast workstation.