International Journal of Stochastic Analysis

International Journal of Stochastic Analysis / 1998 / Article

Open Access

Volume 11 |Article ID 974672 |

Liang Chen, Richard F. Serfozo, "Performance limitations of parallel simulations", International Journal of Stochastic Analysis, vol. 11, Article ID 974672, 13 pages, 1998.

Performance limitations of parallel simulations

Received01 Nov 1997
Revised01 Feb 1998


This study shows how the performance of a parallel simulation may be affected by the structure of the system being simulated. We consider a wide class of “linearly synchronous” simulations consisting of asynchronous and synchronous parallel simulations (or other distributed-processing systems), with conservative or optimistic protocols, in which the differences in the virtual times of the logical processes being simulated in real time t are of the order o(t) as t tends to infinity. Using a random time transformation idea, we show how a simulation's processing rate in real time is related to the throughput rates in virtual time of the system being simulated. This relation is the basis for establishing upper bounds on simulation processing rates. The bounds for the rates are tight and are close to the actual rates as numerical experiments indicate. We use the bounds to determine the maximum number of processors that a simulation can effectively use. The bounds also give insight into efficient assignment of processors to the logical processes in a simulation.

Copyright © 1998 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

More related articles

 PDF Download Citation Citation
 Order printed copiesOrder