Most small-scale simulation applications are implemented by sequential simulation techniques. As the problem size increases, however, sequential techniques may be unable to manage the time complexity of the simulation applications adequately. It is natural to consider re-implementing the corresponding large-scale simulations using parallel techniques, which have been reported to be successful in reducing the time complexity for several examples. However, parallel simulation may not be effective for every application. Since the implementation of parallel simulation for an application is usually very expensive, it is required to investigate the performance of parallel simulation for a particular application before re-implementing the simulation. The Chandy-Misra parallel, discrete-event simulation paradigm has been utilized in many large-scale simulation experiments, and several significant extensions have been based on it. Hence the Chandy-Misra protocol is adopted here as a basic model of parallel simulation to which our performance prediction techniques are applied. For an existing sequential simulation program based on the process interaction model, this paper proposes a technique for evaluating Chandy-Misra parallel simulation without actually implementing the parallel program. The idea is to insert parallelism analysis code into the sequential simulation program. When the modified sequential program is executed, the time complexity of the parallel simulation based on the Chandy-Misra protocol is computed. Our technique has been used to determine whether a giant Signaling System 7 simulation (sequential implementation) should be re-implemented using the parallel simulation approach. >
[1]
K. Mani Chandy,et al.
Asynchronous distributed simulation via a sequence of parallel computations
,
1981,
CACM.
[2]
Wayne M. Loucks,et al.
The Impact of Lookahead on the Performance of Conservative Distributed Simulation
,
1990
.
[3]
Y.-B. Lin,et al.
Exploiting Lookahead in Parallel Simulation
,
1990,
IEEE Trans. Parallel Distributed Syst..
[4]
Yi-Bing Lin,et al.
Optimal memory management for time warp parallel simulation
,
1991,
TOMC.
[5]
R. M. Fujimoto,et al.
Parallel discrete event simulation
,
1989,
WSC '89.
[6]
Richard M. Fujimoto,et al.
Optimistic approaches to parallel discrete event simulation
,
1990
.
[7]
Jayadev Misra,et al.
Distributed discrete-event simulation
,
1986,
CSUR.
[8]
Yi-Bing Lin,et al.
Parallelism analyzers for parallel discrete event simulation
,
1992,
TOMC.
[9]
K. Mani Chandy,et al.
Distributed Simulation: A Case Study in Design and Verification of Distributed Programs
,
1979,
IEEE Transactions on Software Engineering.
[10]
David M. Nicol,et al.
Parallel discrete-event simulation of FCFS stochastic queueing networks
,
1988,
PPEALS '88.
[11]
Edsger W. Dijkstra,et al.
Termination Detection for Diffusing Computations
,
1980,
Inf. Process. Lett..
[12]
Richard M. Fujimoto.
Lookahead in Parallel Discrete Event Simulation
,
1988
.