A null message count of a conservative parallel simulation
- Authors
- Song, HY; Cho, SH; Han, SY
- Issue Date
- 2003
- Publisher
- SPRINGER-VERLAG BERLIN
- Citation
- HIGH PERFORMANCE COMPUTING FOR COMPUTATIONAL SCIENCE - VECPAR 2002, v.2565, pp.493 - 506
- Journal Title
- HIGH PERFORMANCE COMPUTING FOR COMPUTATIONAL SCIENCE - VECPAR 2002
- Volume
- 2565
- Start Page
- 493
- End Page
- 506
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/26630
- ISSN
- 0302-9743
- Abstract
- A performance 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - School of Games > Game Software Major > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/26630)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.