A probabilistic performance model for conservative simulation protocol
- Authors
- Song, HY
- Issue Date
- 2001
- Publisher
- IEEE COMPUTER SOC
- Citation
- 15TH WORKSHOP ON PARALLEL AND DISTRIBUTED SIMULATION, PROCEEDINGS, pp.200 - 207
- Journal Title
- 15TH WORKSHOP ON PARALLEL AND DISTRIBUTED SIMULATION, PROCEEDINGS
- Start Page
- 200
- End Page
- 207
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/28023
- Abstract
- Extensive research has been conducted on the performance of simulation systems. In this paper, a performance analysis of the conservative parallel simulation protocol is presented. We analyzed several performance factors for the conservative simulation of a model with an arbitrary number of logical processes. The analysis probabilistically identifies the critical path in a conservative model, and also estimates the number of safe messages processed by an logical process during its busy time. This can be used to estimate the busy time of a logical process and hence the duration for which it is blocked. The analytical results are verified using simulation of a real world wireless network simulation model.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.