A comparison of simulation event list algorithms
Communications of the ACM
Improved event-scanning mechanisms for discrete event simulation
Communications of the ACM
PASCAL user manual and report
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Parallel Discrete Event Simulation Using Shared Memory
IEEE Transactions on Software Engineering
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Communications of the ACM
Parallel discrete event simulation: a case study
ANSS '85 Proceedings of the 18th annual symposium on Simulation
Analysis of future event set algorithms for discrete event simulation
Communications of the ACM
A two-list synchronization procedure for discrete event simulation
Communications of the ACM
Event manipulation for discrete simulations requiring large numbers of events
Communications of the ACM
A comparison of heaps and the TL structure for the simulation event set
Communications of the ACM
technical correspondence: on the representation of the simulation event set
Communications of the ACM
The design of a multi-microprocessor based simulation computer - I
ANSS '82 Proceedings of the 15th annual symposium on Simulation
Event list management - a tutorial
WSC '83 Proceedings of the 15th conference on Winter Simulation - Volume 2
The simulation of a microprocessor based event set processor
ANSS '81 Proceedings of the 14th annual symposium on Simulation
A Two-list method for synchronization of event driven simulation
ANSS '81 Proceedings of the 14th annual symposium on Simulation
The simulation of a pipelined event set processor
WSC '81 Proceedings of the 13th conference on Winter simulation - Volume 2
Adaptation of the TL event list algorithm to the GASP IV simulation language
WSC '81 Proceedings of the 13th conference on Winter simulation - Volume 2
A proto-language for computer simulation
ANSS '78 Proceedings of the 11th annual symposium on Simulation
A taxonomy and analysis of event set management algorithms for discrete event simulation
ANSS '79 Proceedings of the 12th annual symposium on Simulation
WSC '81 Proceedings of the 13th conference on Winter simulation - Volume 1
MINT: a VHDL simulation system
EURO-DAC '90 Proceedings of the conference on European design automation
An empirical comparison of advanced event file synchronization structures
WSC '82 Proceedings of the 14th conference on Winter Simulation - Volume 1
A high speed list processor for discrete event multiprocessor: simulators
ACM SIGSIM Simulation Digest
P-tree structures and event horizon: efficient event-set implementations
WSC '05 Proceedings of the 37th conference on Winter simulation
| Hi-index | 48.31 |
Recently algorithms have been presented for the realization of event scheduling routines suitable for general purpose discrete event simulation systems. Several exhibited a performance superior to that of commonly used simple linked list algorithms. In this paper a new event scheduling algorithm is presented which improves on two aspects of the best of the previously published algorithms. First, the new algorithm's performance is quite insensitive to skewed distributions, and second, its worst-case complexity is O(√n), where n is the number of events in the set. Furthermore, tests conducted to estimate the average complexity showed it to be nearly independent of n.