ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed discrete-event simulation
ACM Computing Surveys (CSUR)
Efficient and correct execution of parallel programs that share memory
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient distributed event-driven simulations of multiple-loop networks
Communications of the ACM
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Race-free interconnection networks and multiprocessor consistency
ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
The causal ordering abstraction and a simple way to implement it
Information Processing Letters
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
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
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
A New Algorithm to Implement Causal Ordering
Proceedings of the 3rd International Workshop on Distributed Algorithms
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
Memory Consistency Models for Shared-Memory Multiprocessors
Memory Consistency Models for Shared-Memory Multiprocessors
Detecting causal relationships in distributed computations: in search of the holy grail
Distributed Computing
| Hi-index | 0.00 |
This article 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. First, the authors 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. Second, they apply their formalism to extract and formalize the simulation event orderings of both sequential and parallel simulations. Third, they propose the relation stricter and a measure called strictness for comparing and quantifying the degree of event dependency of simulation event orderings, respectively. In contrast to the event parallelism measure, strictness is independent of time.