An algorithm for speculative parallel execution of rendezvous-synchronized simulation

Authors:
Bruno R. Preiss
Affiliations:
Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1
Venue:
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
Year:
1995

Citing 2
Cited 1

High performance parallelized discrete event simulation of stochastic queueing networks

WSC '88 Proceedings of the 20th conference on Winter simulation
On the Distributed Implementation of LOTOS

FORTE '89 Proceedings of the IFIP TC/WG6.1 Second International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols

Conservative synchronization in object-oriented parallel battlefield discrete event simulations

Proceedings of the eleventh workshop on Parallel and distributed simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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[2]. Time is introduced via a mechanism similar to the delay behaviour annotation provided by the TOPO toolset[4-6].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.