BULK SYNCHRONOUS PARALLEL ALGORITHMS FOR CONSERVATIVE DISCRETE EVENT SIMULATION∗
- 1 January 1996
- journal article
- research article
- Published by Taylor & Francis in Parallel Algorithms and Applications
- Vol. 9 (1-2) , 15-38
- https://doi.org/10.1080/10637199608915562
Abstract
All the parallel discrete event simulation algorithms developed so far have been designed to suit a specific parallel model (e.g., a PRAM model, a MP-RAM model, etc.). This paper presents several versions of conservative parallel discrete event simulation algorithms developed around a unifying model for general purpose parallel computer design and programming, namely around the Bulk Synchronous Parallel (BSP) model. The new algorithms are analysed in terms of the BSP model parameters and the effectiveness of simulators based on these algorithms is evaluated. The performance achieved even for a loosely coupled distributed system is comparable with that reported in previous research work, while the generality of the BSP model provides portability to the new approaches.Keywords
This publication has 13 references indexed in Scilit:
- Direct Bulk-Synchronous Parallel AlgorithmsJournal of Parallel and Distributed Computing, 1994
- A logic-based foundation of discrete event modeling and simulationACM Transactions on Modeling and Computer Simulation, 1994
- A unifying framework for distributed simulationACM Transactions on Modeling and Computer Simulation, 1991
- The distributed simulation of clustered processesDistributed Computing, 1991
- Parallel discrete event simulationCommunications of the ACM, 1990
- A bridging model for parallel computationCommunications of the ACM, 1990
- Efficient distributed event-driven simulations of multiple-loop networksCommunications of the ACM, 1989
- Parallel discrete event simulation using shared memoryIEEE Transactions on Software Engineering, 1988
- Distributed discrete-event simulationACM Computing Surveys, 1986
- Virtual timeACM Transactions on Programming Languages and Systems, 1985