An Algorithm for Speculative Parallel Execution of Rendezvous-Synchronized Simulation

Website of Bruno R. Preiss

Next : On the Performance of Up: Conference Papers Previous: Memory Management Techniques for

---

An Algorithm for Speculative Parallel Execution of Rendezvous-Synchronized Simulation

  Bruno  Richard Preiss. In Proc. 1995 Workshop on Parallel and Distributed Simulation , pages 11-20, Lake Placid, NY, June 1995. Institute of Electrical and Electronics Engineers, Inc.[37].

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 the basic process algebra of L OTOS --a standard formal specification language for temporal ordering. Time is introduced via a mechanism similar to the delay behaviour annotation provided by the T OPO 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.

Copyright 1995 by Institute of Electrical and Electronics Engineers, Inc.

Full text. Presentation slides. BibTeX entry.

---

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