Conservative and optimistic distributed simulation in massively parallel computers: a comparative study

Abstract

The main algorithms for sequential and parallel discrete event simulations are introduced. A set of different simulators is evaluated and compared using a transputer-based multicomputer: sequential, parallel conservative and parallel optimistic. For the proposed model, the conservative simulator shows better speedups. The obtained results show that a significant improvement on execution time can be obtained using parallel systems, but only if the model under simulation have some properties like coarse grain size and high degree of self-synchronisation.<>