The main problem associated with comparing distributed discrete event simulation mechanisms is the need to base the comparisons on some common problem specification. This paper presents a specification strategy and language which allows the same simulation problem specification to be used for both distributed discrete event simulation mechanisms as well as the traditional single event list mechanism. This paper includes: a description of the Yaddes specification language; a description of the four simulation mechanisms currently supported; the results for three simulation examples; and an estimate of the performance of a communication structure needed to support the various simulation mechanisms. Currently this work has only been done on a uniprocessor emulating a multiprocessor. This has limited some of our results but lays a significant basis for future simulation mechanism comparison.
[1]
K. M. Chandy,et al.
Conditional Knowledge as a Basis for Distributed Simulation
,
1987
.
[2]
Phil Hontalas,et al.
Distributed Simulation and the Time Wrap Operating System.
,
1987,
SOSP 1987.
[3]
Wayne M. Loucks,et al.
The P-MACHIne : A Hardware Message Accelerator for a Multiprocessor System
,
1987,
International Conference on Parallel Processing.
[4]
Allen D. Malony,et al.
Parallel Discrete Event Simulation Using Shared Memory
,
1988,
IEEE Trans. Software Eng..
[5]
Murray Hill,et al.
Yacc: Yet Another Compiler-Compiler
,
1978
.
[6]
David R. Jefferson,et al.
Virtual time
,
1985,
ICPP.