ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed discrete-event simulation
ACM Computing Surveys (CSUR)
Efficient distributed event-driven simulations of multiple-loop networks
Communications of the ACM
Time management in the DoD high level architecture
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
The threshold of event simultaneity
Proceedings of the eleventh workshop on Parallel and distributed simulation
On event ordering in parallel discrete event simulation
PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
Exploiting temporal uncertainty in parallel and distributed simulations
PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Parallel and Distribution Simulation Systems
Parallel and Distribution Simulation Systems
Parallel Computer Architecture: A Hardware/Software Approach
Parallel Computer Architecture: A Hardware/Software Approach
Critical causality in distributed virtual environments
Proceedings of the sixteenth workshop on Parallel and distributed simulation
Performance Trade-Off in Distributed Simulation
DS-RT '02 Proceedings of the Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications
Effect of Event Orderings on Memory Requirement in Parallel Simulation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
| Hi-index | 0.00 |
This paper advocates the use of a formal framework for analyzing simulation performance. Simulation performance is characterized based on the three simulation development process boundaries: physical system, simulation model, and simulator implementation. Firstly, we formalize simulation event ordering using partially ordered set theory. A simulator implements a simulation event ordering, and incurs implementation overheads when enforcing event ordering at runtime. Secondly, we apply our formalism to extract and formalize the simulation event orderings of both sequential and parallel simulations. Thirdly, we propose the relation stricter and a measure called strictness for comparing and quantifying the degree of event dependency of simulation event orderings respectively.