Shorey, Rajeev and Kumar, Anurag and Rege, Kiran M (1997) Instability and Performance Limits of Distributed Simulators of Feedforward Queueing Networks. In: ACM Transactions on Modeling and Computer Simulation, 7 (2). pp. 210-238.
In this article we study the performance of distributed simulation of open feedforward queueing networks, by analyzing queueing models of message flows in distributed discrete event simulators. We view each logical process in a distributed simulation as comprising a message sequencer with associated message queues, followed by an event processor. We introduce the idealized, but analytically useful, concept of maximum lookahead. We show that, with quite general stochastic assumptions for message arrival and time-stamp processes, the message queues are unstable for conservative sequencing, and for conservative sequencing with maximum lookahead and hence for optimistic resequencing, and for any resequencing algorithm that does not employ interprocessor flow control.Finally, we provide formulas for the throughput of distributed simulators of feedforward queueing networks.
|Item Type:||Journal Article|
|Additional Information:||©ACM,1997.This is the author's version of the work.It is posted here by permission of ACM for your personal use. Not for redistribution.The definitive version was published in ACM Transactions on Modeling and Computer Simulation, Vol. 7, No. 2, April 1997 http://doi.acm.org/10.1145/249204.249206|
|Keywords:||Simulation Theory;Types of Simulation;Algorithms;Performance;Distributed discrete event simulation;event synchronization;stability of queueing systems|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||08 Jun 2004|
|Last Modified:||19 Sep 2010 04:12|
Actions (login required)