Billiards and related systems on the bulk-synchronous parallel model
- 1 June 1997
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
With two examples we show the suitability of the bulk-synchronous parallel (BSP) model for discrete-event simulation of homogeneous large-scale systems. This model provides a unifying approach for general purpose parallel computing which in addition to efficient and scalable computation, ensures portability across different parallel architectures. A valuable feature of this approach is a simple cost model that enables precise performance prediction of BSP algorithms. We show both theoretically and empirically that systems with uniform event occurrence among their components, such as colliding hard-spheres and ising-spin models, can be efficiently simulated in practice on current parallel computers supporting the BSP model.Keywords
This publication has 11 references indexed in Scilit:
- An empirical assessment of priority queues in event-driven molecular dynamics simulationComputer Physics Communications, 1995
- Efficient Algorithms for Many-Body Hard Particle Molecular DynamicsJournal of Computational Physics, 1993
- Reduction of the event-list for molecular dynamic simulationComputer Physics Communications, 1992
- How to simulate billiards and similar systemsJournal of Computational Physics, 1991
- Discrete event simulation of object movement and interactionsSIMULATION, 1991
- A bridging model for parallel computationCommunications of the ACM, 1990
- Efficient distributed event-driven simulations of multiple-loop networksCommunications of the ACM, 1989
- Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problemCommunications of the ACM, 1988
- Efficient parallel simulations of dynamic Ising spin systemsJournal of Computational Physics, 1988
- The event scheduling problem in molecular dynamic simulationJournal of Computational Physics, 1980