Complexity analyses of event set algorithms
The Computer Journal
Concurrent Access of Priority Queues
IEEE Transactions on Computers
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Communications of the ACM
An experimental analysis of event set algorithms for discrete event simulation
Microprocessing and Microprogramming
Discrete-event simulation and the event horizon
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
Discrete-event simulation and the event horizon part 2: event list management
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
Analysis of future event set algorithms for discrete event simulation
Communications of the ACM
A comparison of heaps and the TL structure for the simulation event set
Communications of the ACM
An efficient data structure for the simulation event set
Communications of the ACM
Meldable heaps and boolean union-find
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Proceedings of the 32nd conference on Winter simulation
Simulation Techniques for Discrete Event Systems
Simulation Techniques for Discrete Event Systems
Data Structures and Their Algorithms
Data Structures and Their Algorithms
Simulation Modeling and Analysis
Simulation Modeling and Analysis
| Hi-index | 0.00 |
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for maintaining future events in a general purpose discrete event simulation system, and studies the performance of their event set algorithms under the event horizon principle. For comparison reasons, some well-known event set algorithms were also selected and studied; that is, the Dynamic-heap and the P-tree algorithms. To gain insight into the performance of the proposed event set algorithms and allow comparisons with the other selected algorithms, they are tested under a wide variety of conditions in an experimental way. The time needed for the execution of the Hold operation is taken as the measure for estimating the average time complexity of the algorithms. The experimental results show that the BP-tree algorithm and the IBP-tree algorithm behave very well with all the sizes of the event set and their performance is almost independent from the stochastic distributions.