Self-adjusting binary search trees
Journal of the ACM (JACM)
An empirical comparison of priority-queue and event-set implementations
Communications of the ACM
Numerical recipes in C: the art of scientific computing
Numerical recipes in C: the art of scientific computing
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Communications of the ACM
Efficient implementation of event sets in Time Warp
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
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
A performance comparison of event calendar algorithms: an empirical approach
Software—Practice & Experience
C++ object-oriented data structures
C++ object-oriented data structures
Discrete-event simulation and the event horizon
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
Effectiveness of global event queues in rollback reduction and load balancing
PADS '95 Proceedings of the ninth 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
Applying Data Structures
Proceedings of the 2002 ACM symposium on Applied computing
Event List Management in Distributed Simulation
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Predictable Time Management for Real-Time Distributed Simulation
Proceedings of the seventeenth workshop on Parallel and distributed simulation
P-tree structures and event horizon: efficient event-set implementations
WSC '05 Proceedings of the 37th conference on Winter simulation
Design and implementation of time management service for IEEE 1516 HLA/RTI
Proceedings of the 2007 Summer Computer Simulation Conference
| Hi-index | 0.00 |
The event horizon is a very important concept that applies to both parallel and sequential discrete-event simulations. By exploiting the event horizon, parallel simulations can processes events optimistically in a risk-free manner (i.e., without requiring antimessages) using adaptable "breathing" time cycles with variable time widths. Additionally, exploiting the event horizon can significantly reduce the overhead of event list management that is common to virtually all discrete-event simulations. This paper is a continuation of work previously reported at PADS94. In that report, a complete mathematical formulation of the event horizon was derived under equilibrium conditions using the hold model. Various forms of the beta density function were consequently used to verify the predicted results of the analytic model. This second report describes how the concept of the event horizon can also be applied to event list management. By exploiting the event horizon, the performance of several priority queue data structures are improved including: linked lists, various binary trees, and heaps. A somewhat detailed description of these modified data structures along with other relevant background information is provided for completeness. Performance results for each of these priority queue data structure is provided.