This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Predicting the Performance of Synchronous Discrete Event Simulation
December 2004 (vol. 15 no. 12)
pp. 1130-1137

Abstract—In this paper, we develop a model to predict the performance of synchronous discrete event simulation. Our model considers the two most important factors for the performance of synchronous simulation: load balancing and communication. The effect of load balancing in a synchronous simulation is computed using probability distribution models. We derive a formula that computes the cost of synchronous simulation by combining a communication model called LogGP and computation granularity. Even though the formula is simple, it is effective in capturing the most important factors for the synchronous simulation. The formula helps us to predict the maximum speed up achievable by synchronous simulation. In order to examine the prediction model, we have simulated several large ISCAS logic circuits and a simple PCS network simulation on an SGI Origin 2000 and Terascale Computing System (TCS) at the Pittsburgh Supercomputing Center. The results of the experiment show that our performance model accurately predicts the performance of synchronous simulation. The performance model developed is used to analyze the effect of several factors that may improve the performance of synchronous simulation. The factors include problem size, load balancing, granularity, communication overhead, and partitioning.

[1] V.D. Agrawal and S. Chakradhar, “Performance Analysis of Synchronized Iterative Algorithms on Multiprocessors Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 3, Nov. 1992.
[2] A. Alexandrov, M. Ionescu, K.E. Schauser, and C. Scheiman, “LogGP: Incorporating Long Messages into the LogP Model— One Step Closer Towards a Realistic Model for Parallel Computation,” Proc. Seventh Ann. Symp. Parallel Algorithms and Architecture, 1995.
[3] H. Avril and C. Tropper, “On Rolling Back and Checkpointing in Time Warp,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 11, Nov. 2001.
[4] R.L. Bagrodia and M. Takai, “Performance Evaluation of Conservative Algorithms in Parallel Simulation Languages,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 4, Apr. 2000.
[5] F. Brglez, D. Bryan, and K. Kozminski, “Combinational Profiles of Sequential Benchmark Circuits,” Proc. IEEE Int'l Symp. Circuits and Systems, 1989.
[6] C.D. Carothers, R.M. Fujimoto, Y.B. Lin, and P. England, “Distributed Simulation of Large Scale PCS Networks,” Proc. Second Int'l Workshop Modeling, Analysis, and Simulation of Computer and Telecomm. Systems, 1994.
[7] K.M. Chandy and J. Misra, “Distributed Simulation: A Case Study in Design and Verification of Distributed Programs,” IEEE Trans. Software Eng., 1979.
[8] R.D. Chamberlain, “Parallel Logic Simulation of VLSI Systems,” Proc. 32nd Design Automation Conf., 1995.
[9] E.C. Chung and M.J. Chung, “An Important Factor for Optimistic Protocol on Distributed Systems: Granularity,” Proc. Winter Simulation Conf., 1995.
[10] M.J. Chung, J. Xu, and H.C. Kim, “Parallel VHDL Simulation Engine,” technical report, Dept. of Defense High Performance Computing Modernization Program, 1998.
[11] D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken, “LogP: Towards a Realistic Model of Parallel Computation,” Proc. Fourth ACM SIGPLAN Symp. Principal and Practice of Parallel Programming, 1993.
[12] P.M. Dickens, D.M. Nicol, P.F. Reynolds, and J.M. Duva, “Analysis of Bounded Time Warp and Comparison with YAWNS,” ACM Trans. Modeling and Computer Simulations, 1997.
[13] C. Dubnicki, L. Iftode, E. Felten, and K. Li, “Software Support for Virtual Memory-Mapped Communication,” Proc. 10th Int'l Parallel Processing Symp., 1996.
[14] T. vonEicken, D.E. Culler, S.C. Goldstein, K.E. Schauser, “Active Messages: a Mechanism for Integrated Communication and Computation,” Proc. 19th Int'l Symp. Computer Architecture, 1992.
[15] R.E. Felderman and L. Kleinrock, “An Upper Bound on the Improvement of Asynchronous versus Synchronous Distributed Processing,” Proc. SCS Multiconf. Distributed Simulation, 1990.
[16] A. Ferscha, “Parallel and Distributed Simulation of Discrete Event Systems,” Handbook of Parallel and Distributed Computing, 1995.
[17] High performance benchmarking web site, http://www.hp.com/techservers/benchmarks web_sites.html#systems, 2003.
[18] D.R. Jefferson, “Virtual Time,” ACM Trans. Programming Languages and Systems, 1985.
[19] C.C. Lim, Y.-H. Low, B.-P. Gan, S. Jain, W. Cai, W.J. Hsu, and S.Y. Huang, “Performance Prediction Tools for Parallel Discrete-Event Simulation,” Proc. 30th Workshop Parallel and Distributed Simulation, May 1999.
[20] P. Konas and P.-C. Yew, “Parallel Discrete Event Simulation on Shared-Memory Multiprocessors,” Proc. 24th Ann. Simulation Symp., 1991.
[21] P. Konas, “Parallel Architectural Simulation on Shared-Memory Multiprocessors,” PhD Thesis, Univ. of Illinois at Urbana-Champaign, 1994.
[22] J. Kuskin, D. Ofelt, M. Heinrich, J. Heinlein, R. Simoni, K. Gharachorloo, J. Chapin, D. Nakahira, J. Baxter, M. Horowitz, A. Gupta, M. Rosenblum, and J. Hennessy, “The Stanford FLASH Multiprocessor,” Proc. 21st Int'l Symp. Computer Architecture, 1994.
[23] Y.B. Lin, “Parallelism Analyzers for Parallel Discrete Event Simulation,” ACM Trans. Modeling and Computer Simulation, 1992.
[24] B.D. Lubachevsky, A. Weiss, and A. Shwartz, “An Analysis of Rollback-Based Simulation,” ACM Trans. Modeling and Computer Simulation, 1991.
[25] D.M. Nicol, “Performance Bounds on Parallel Self-Initiating Discrete Event Simulations,” ACM Trans. Modeling and Computer Simulation, 1991.
[26] J.K. Peacock, J.W. Wong, and E.C. Manning, “Distributed Simulation Using a Network of Processors,” Computer Networks, 1979.
[27] F. Quaglia, V. Cortellessa, B. Ciciani, “Trade-Off between Sequential and Time Warp-Based Parallel Simulation,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 8, Aug. 1999.
[28] C. Schaubschlaeger, “Measurements of SKaMPI, Version 2.2 of SGI Origin 2000 at GUP/ZID,” Univ. of Linz, Austria, 1999.
[29] L. Soule and A. Gupta, “An Evaluation of Chandy-Misra-Bryant Algorithm for Digital Logic Simulation,” ACM Trans. Modeling and Computer Simulation, 1991.
[30] L. Soule, “Parallel Logic Simulation: An Evaluation of Centralized-Time and Distributed-Time Algorithms,” PhD thesis, Stanford Univ., June 1992.
[31] J. Steinman, “SPEEDES: A Multiple-Synchronization Environment for Parallel Discrete-Event Simulation,” Int'l J. Computer Simulation, 1992.
[32] L.G. Valiant, “A Bridging Model For Parallel Computation,” Comm. ACM, 1990.

Index Terms:
Parallel discrete event simulation, performance evaluation.
Citation:
Jinsheng Xu, Moon Jung Chung, "Predicting the Performance of Synchronous Discrete Event Simulation," IEEE Transactions on Parallel and Distributed Systems, vol. 15, no. 12, pp. 1130-1137, Dec. 2004, doi:10.1109/TPDS.2004.85
Usage of this product signifies your acceptance of the Terms of Use.