This paper examines the suite of closed, stochastic queueing networks proposed by Nicol in order to determine how much impact additional knowledge has on the computation load and the communication load for the multiprocessor running the distributed simulation. Four different networks have been studied at three different levels of traffic intensity. For each network-load pair, four simulation models wereconstructed , each based on increasing use ofuser knowledge at a queueing node: no knowledge; service discipline knowledge; queueing discipline knowledge; and routing knowledge. In each case the number of logical process activations and the number of messages used by the distributed simulation was determined and compared to the number of activations needed in a traditional, event-list-driven simulation.In the area of computation needed, distributed simulation using a conservative synchronization algorithm
permits between one half and twothirds of the computation to be eliminated when user knowledge is added to the simulation. The results presented also indicate that the differences caused by the additional knowledge are about twice as dramatic in their impact on communication load as they are on the computation load. The results from using an optimistic synchronization algorithmindicate savings of a similar magnitude, except there is a better reduction in computation than in communication. In all but one case the reduction caused by the additional knowledge is less than an order of magnitude.
Copyright 1990 by Simulation Councils, Inc.
Full text.
BibTeX entry.
Copyright 2002 by Bruno R. Preiss, P.Eng. All rights reserved.
Tue Jan 1 13:41:25 EST 2002
This paper describes a simulation specification language and execution environments that are being used to study the performance of distributed discrete event simulation. First, a simulation programming model based on Chandy-Misra distributed discrete event simulation is presented. Then, the Yaddes simulation specification language is described. Yaddes specifications are translated into C language programs which are then compiled and linked with a run-time support library. Next, the implementation of the run-time support libraries is described. The four libraries currently supported are: (1) traditional, event-list-driven discrete event simulation, (2) distributed discrete event simulation based on multiple, synchronized event lists, (3) Chandy-Misra distributed discrete event simulation, and (4) virtual-time-based distributed discrete event simulation.
Copyright 1989 by Simulation Councils, 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