A Time-Delayed-Rendezvous Model for Parallel Discrete Event Simulation

logo Website of Bruno R. Preiss
next up contents external
Next : A New Model for Up: Unpublished Manuscripts Previous: Ynot Logic Simulator: A

  Bruno  Richard Preiss. 1994[36].
This report extends the model for parallel discrete event simulation presented in [34] by introducing the notion of time. 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 .

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. In the case where the simulation processes are time-invariant , the optimistic execution admits additional parallelism via the mechanism of time shifting.

The model is used to describe closed stochastic queueing network simulations. Simulations of various queueing network topologies have implemented. Analysis of preliminary results suggests that the model makes available a limited degree of parallelism.

Copyright 1994 by Bruno R. Preiss.

external Full text. external BibTeX entry.



bruno Copyright 2002 by Bruno R. Preiss, P.Eng. All rights reserved.
Tue Jan 1 13:41:25 EST 2002



Data Structures and Algorithms With Object-Oriented Design Patterns in Java
Data Structures and Algorithms with Object-Oriented Design Patterns in Java (Worldwide Series in Computer Science)
ISBN: 0471346136
EAN: 2147483647
Year: 1999
Pages: 100

flylib.com © 2008-2017.
If you may any questions please contact us: flylib@qtcs.net