An algorithm for speculative parallel execution of rendezvous-synchronized simulation

This paper presents an approach for speculative parallel execution of rendezvous-synchronized simulations. Rendezvous-synchronized simulation is based on the notions of processes and gates and on the rendezvous mechanism, defined in the basic process algebra of LOTOS-a standard formal specification language for temporal ordering. Time is introduced via a mechanism similar to the delay behaviour annotation provided by the TOPO toolset. The algorithm allows speculative gate activations. This increases the available parallelism while ensuring correct execution of the computation. The model is used to describe closed stochastic queueing network simulations. Analysis of their execution results suggests that the model makes available a promising degree of parallelism