Self-adjusting binary search trees
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
An empirical comparison of priority-queue and event-set implementations
Communications of the ACM
Rollback sometimes works...if filtered
WSC '89 Proceedings of the 21st conference on Winter simulation
Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
Performance bounds on parallel self-initiating discrete-event simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
Performance of a riskfree Time Warp operating system
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
WSC '93 Proceedings of the 25th conference on Winter simulation
Lazy queue: an efficient implementation of the pending-event set
ANSS '91 Proceedings of the 24th annual symposium on Simulation
A spectrum of options for parallel simulation
WSC '88 Proceedings of the 20th conference on Winter simulation
Exploiting Lookahead in Parallel Simulation
IEEE Transactions on Parallel and Distributed Systems
Discrete-event simulation and the event horizon part 2: event list management
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
A comparative study of parallel and sequential priority queue algorithms
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Performance modeling of the IDES framework
Proceedings of the eleventh workshop on Parallel and distributed simulation
Generalizing lookahead—behavioral prediction in distributed simulation
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
Proceedings of the 2002 ACM symposium on Applied computing
Adaptive algorithms for the dynamic distribution and parallel execution of agent-based models
Journal of Parallel and Distributed Computing - Special issue on parallel bioinspired algorithms
P-tree structures and event horizon: efficient event-set implementations
WSC '05 Proceedings of the 37th conference on Winter simulation
Event behavior of discrete event simulations in CD++ vs. NS-2
Proceedings of the 2008 Spring simulation multiconference
Event Based Simulator for Parallel Computing over the Wide Area Network for Real Time Visualization
IVIC '09 Proceedings of the 1st International Visual Informatics Conference on Visual Informatics: Bridging Research and Practice
| Hi-index | 0.00 |
The event horizon is a very important concept that is useful for both parallel and sequential discrete-event simulations. By exploiting the event horizon, parallel simulations can process events in a manner that is risk-free (i.e., no antimessages) in adaptable “breathing” time cycles with variable time widths. Additionally, exploiting the event horizon can greatly reduce the event list management overhead that is common to virtually all discrete-event simulations.This paper develops an analytic model describing the event horizon from first principles using equilibrium considerations and the hold model (where each event, when consumed, generates a single new event with future-time statistics described by a known probability function). Exponential and Beta-density functions are used to verify the mathematics presented in this paper.