The Community for Technology Leaders
Proceedings 16th Workshop on Parallel and Distributed Simulation (2002)
Washington, D.C.
May 12, 2002 to May 15, 2002
ISSN: 1087-4097
ISBN: 0-7695-1608-4
pp: 107
Steve L. Ferenci , Georgia Institute of Technology
Richard M. Fujimoto , Georgia Institute of Technology
Mostafa H. Ammar , Georgia Institute of Technology
Kalyan Perumalla , Georgia Institute of Technology
A technique called updateable simulations is proposed to reduce the time to complete multiple executions of a discrete event simulation program. This technique updates the results of a prior simulation run rather than re-execute the entire simulation to take into account variations in the underlying simulation model. A framework for creating updateable simulations is presented. This framework is applied to the problem of simulating a set of cascaded ATM multiplexers and a network of ATM switches. Performance measurements of sequential and parallel implementations of these simulations on a shared memory multiprocessor are presented, demonstrating that updateable simulations can yield substantial reductions in the time required to complete multiple simulation runs if there is much similarity among the runs.
shared computation, event reuse, event composition

M. H. Ammar, R. M. Fujimoto, K. Perumalla and S. L. Ferenci, "Updateable Simulation of Communication Networks," Proceedings 16th Workshop on Parallel and Distributed Simulation(PADS), Washington, D.C., 2002, pp. 107.
87 ms
(Ver 3.3 (11022016))