An Attributed, Time-Delayed Rendezvous Model for Parallel Discrete Event Simulation | Data Structures and Algorithms with Object-Oriented Design Patterns in C++

Website of Bruno R. Preiss

Next : Dynamic Rescheduling of Tasks Up: Unpublished Manuscripts Previous: A Skeleton-Based Model for

Bruno Richard Preiss. January 1996[39].

This report extends the model for parallel discrete event simulation presented in [37, 36, 34] by introducing the notion attributes (messages). The model is based on the notions of processes and gates and on the rendezvous mechanism defined in the the basic L OTOS process algebra. Time is introduced via a mechanism similar to the delay behaviour annotation provided by the T OPO toolset. Communication between processes is supported by the L OTOS mechanisms of value passing (but not value generation).
An algorithm is presented that allows optimistic gate activations (i.e., speculative computation). This increases the available parallelism while ensuring correct execution of the simulation. This speculative computation can be performed without the expensive overheads associated with checkpointing and rollback recovery.

The model is used to describe two different simulation applications--closed stochastic queue networks simulations and logic simulation. Analysis of preliminary results suggests that the model is successful at making available a degree of speculative parallelism.

external Full text.