Abstract
Ap erformance analysis of the conservative parallel simulation protocol is presented in this study. We analyze several performance factors of a simulation model with an arbitrary number of logical processes. The analysis probabilistically identifies the critical path in a conservative model, and it also estimates the number of null messages, which is the major overhead factor of a conservative simulation. Apart from the factors of the hardware platform on which a simulation system is running, null message count is completely based on logical factors such as properties of simulation topology and simulation protocol. Null message count can be estimated in terms of lookahead of logical processes, simulation time, and the connectivity of simulation topology. Several experimental results have been presented to verify the null message count model. Capturing the null message count will lead to a new idea of how to revise the simulation model in order to improve the performance of a conservative parallel simulation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Jefferson. Virtual time. ACM TOPLAS, 7(3):404–425, July 1985. 493
K. M. Chandy and J. Misra. Asynchronous distributed simulation via a sequence of parallel computations. Communications of the ACM, 24(11):198–206, 1981. 493
R. E. Bryant. Simulation of Packet Communications Architecture Computer Systems. Technical Report MIT-LCS-TR-188, Massachusetts Institute of Technology, 1977. 493
R. Felderman and L. Kleinrock. Two Processor Conservative Simulation Analysis. In Proceedings of the 6th Workshop on Parallel and Distributed Simulation (PADS92), pages 169–177, 1992. 494
David M. Nicol. The cost of conservative synchronization in parallel discrete event simulations. Journal of the ACM, 1967-, 40, 1993. 494
M. L. Bailey and Pagels M. A. Empirical measurements of overheads in conservative asynchronous simulations. ACM Transactions on Modeling and Computer Simulation, 4(4):350–367, 1994. 494
Ha Yoon Song. A probabilistic performance model for conservative simulation protocol. In Proceedings of the 15th Workshop on Parallel and Distributed Simulation PADS2001), Lake Arrowhead, CA, USA, 2001. 494
Rajive Bagrodia, Richard Meyer, Mineo Takai, Yu an Chen, Xiang Zeng, Jay Martin, and Ha Yoon Song. Parsec: Ap arallel simulation environment for complex systems. Computer, 31(10):77–85, October 1998. 495
R. M. Fujimoto. Performance of time warp under synthetic workloads. In Proceedings of the SCS Multiconference on Distributed Simulation, San Diago, CA, USA, 1990. 501
H. Y. Song, R. A. Meyer, and R. L. Bagrodia. An empirical study of conservative scheduling. In Proceedings of the 14th Workshop on Parallel and Distributed Simulation (PADS2000), Bologna, Italy, 2000. 501
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Song, H.Y., Cho, S.H., Han, S.Y. (2003). A Null Message Count of a Conservative Parallel Simulation. In: Palma, J.M.L.M., Sousa, A.A., Dongarra, J., Hernández, V. (eds) High Performance Computing for Computational Science — VECPAR 2002. VECPAR 2002. Lecture Notes in Computer Science, vol 2565. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36569-9_33
Download citation
DOI: https://doi.org/10.1007/3-540-36569-9_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00852-1
Online ISBN: 978-3-540-36569-3
eBook Packages: Springer Book Archive