A null message count of a conservative parallel simulation

Authors:
Ha Yoon Song;Sung Hyun Cho;Sang Yong Han
Affiliations:
College of Information and Computer Engineering, Hongik University, Seoul, Korea;School of Software and Game, Hongik University, Chungnam, Korea;School of Computer Science, Seoul National University, Seoul, Korea
Venue:
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
Year:
2002

Citing 8
Cited 1

Virtual time

ACM Transactions on Programming Languages and Systems (TOPLAS)
The cost of conservative synchronization in parallel discrete event simulations

Journal of the ACM (JACM)
Empirical measurements of overheads in conservative asynchronous simulations

ACM Transactions on Modeling and Computer Simulation (TOMACS)
An empirical study of conservative scheduling

PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
Asynchronous distributed simulation via a sequence of parallel computations

Communications of the ACM - Special issue on simulation modeling and statistical computing
A probabilistic performance model for conservative simulation protocol

Proceedings of the fifteenth workshop on Parallel and distributed simulation
Parsec: A Parallel Simulation Environment for Complex Systems

Computer
SIMULATION OF PACKET COMMUNICATION ARCHITECTURE COMPUTER SYSTEMS

SIMULATION OF PACKET COMMUNICATION ARCHITECTURE COMPUTER SYSTEMS

An Analytical Model of Scheduling for Conservative Parallel Simulation

Proceedings of the 9th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface

Quantified Score

Hi-index	0.00

Visualization

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.