This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Parallelism Analyzer for Conservative Parallel Simulation
June 1995 (vol. 6 no. 6)
pp. 628-638

Abstract—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.

Index Terms—Chandy-Misra protocol, critical path analysis, Discrete event simulation, parallelism, parallel simulation

[1] R. Fujimoto, “Parallel Discrete Event Simulation,” Comm. ACM, vol. 33, no. 10, pp. 30-53, Oct. 1990.
[2] O. Berry and D. Jefferson,“Critical path analysis of distributed simulation,”inProc. 1985 SCS Multiconf. Distribut. Simulation, Jan. 1985, pp. 57–60.
[3] M. Livny,“A study of parallelism in distributed simulation,”inProc. 1985 SCS Multiconf. Distrib. Simulation, Jan. 1985, pp. 94–98.
[4] Y.B. Lin, “Parallelism Analyzers for Parallel Discrete Event Simulation,” ACM Trans. Modeling and Computer Simulation, vol. 2, no. 3, pp. 239–264, July 1992.
[5] K. M. Chandy and J. Misra,“Distributed simulation: A case study in design and verification of distributed programs,”IEEE Trans. Software Eng., vol. SE-5, pp. 440–452, Sept. 1979.
[6] R. M. Fujimoto,“Optimistic approaches to parallel discrete event simulation,”Trans. Soc. Comput. Simulation, vol. 7, pp. 153–191, June 1990.
[7] ——,“Performance of time warp under synthetic workloads,”inProc. 1990 SCS Multiconf. Distrib. Simulation, Jan. 1990, pp. 23–28.
[8] Y-B. Lin and B.R. Preiss, "Optimal Memory Management for Time Warp Parallel Simulation," ACM Trans. Modeling and Computer Simulation, vol. 1, no. 4, pp. 283-307, Oct. 1991.
[9] D. Jefferson,“Virtual time II: The cancelback protocol for storage management in time warp,”inProc. 9th Annu. ACM Symp. Princip. Distrib. Comput., Aug. 1990, pp. 75–90.
[10] R. M. Fujimoto,“Lookahead in parallel discrete event simulation,”inProc. Int. Conf. Parallel Process., vol. III, 1988, pp. 34–41.
[11] B. R. Preiss and W. M. Loucks,“Impact of lookahead on the performance of conservative distributed simulation,”inProc. SCS Europ. Multiconf. Simulation Method., Lang., Architect., 1990, pp. 204–209.
[12] D.M. Nicol, “Parallel Discrete Event Simulation of FCFS Stochastic Queuing Networks,” Parallel Programming: Experience with Applications, Languages and Systems, ACM SIGPLAN, pp. 124–137, July 1988.
[13] Y.-B. Lin and E. D. Lazowska,“Exploiting lookahead in parallel simulation,”IEEE Trans. Parallel Distrib. Syst., vol. 1, pp. 457–469, Oct. 1990.
[14] K.M. Chandy and J. Misra, “Asynchronous Distributed Simulation via a Sequence of Parallel Computations,” Comm. ACM, vol. 24, no. 11, pp. 198–206, Aug. 1981.
[15] E. W. Dijkstra and C. S. Scholten,“Termination detection for diffusing computations,”Inform. Process. Lett., vol. 11, no. 3, pp. 1–4, 1980.
[16] L. Liu and C. Tropper,“Local deadlock detection in distributed simulations,”inProc. 1990 SCS Multiconf. Distrib. Simulation, Jan. 1990, pp. 64–69.
[17] J. Misra, "Distributed Discrete-Event Simulation," ACM Computing Surveys, vol. 18, no. 1, pp. 39-65, Mar. 1986.
[18] J. A. Payne,Introduction to Simulation. New York: McGraw-Hill, 1982.

Citation:
Yung-Chang Wong, Shu-Yuen Hwang, Jason Yi-Bing Lin, "A Parallelism Analyzer for Conservative Parallel Simulation," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 6, pp. 628-638, June 1995, doi:10.1109/71.388043
Usage of this product signifies your acceptance of the Terms of Use.