Introduction to operations research, 4th ed.
Introduction to operations research, 4th ed.
An introduction to simulation using GPSS/H
An introduction to simulation using GPSS/H
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A Time-Sharing Queue with a Finite Number of Customers
Journal of the ACM (JACM)
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
An efficient data structure for the simulation event set
Communications of the ACM
Heaps applied to event driven mechanisms
Communications of the ACM
A comparison of simulation event list algorithms
Communications of the ACM
Improved event-scanning mechanisms for discrete event simulation
Communications of the ACM
WSC '76 Proceedings of the 76 Bicentennial conference on Winter simulation
A taxonomy and analysis of event set management algorithms for discrete event simulation
ANSS '79 Proceedings of the 12th annual symposium on Simulation
An improved events list algorithm
WSC '77 Proceedings of the 9th conference on Winter simulation - Volume 2
Analysis of future event set algorithms for discrete event simulation
Analysis of future event set algorithms for discrete event simulation
The process view of simulation (Operating and programming systems series)
The process view of simulation (Operating and programming systems series)
An empirical comparison of priority-queue and event-set implementations
Communications of the ACM
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Communications of the ACM
A system for computer music performance
ACM Transactions on Computer Systems (TOCS)
Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
Performance analysis of future event sets
WSC '95 Proceedings of the 27th conference on Winter simulation
A comparative study of parallel and sequential priority queue algorithms
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Complexity of simulation models: a graph theoretic approach
WSC '93 Proceedings of the 25th conference on Winter simulation
GMSim: a tool for compositional GSMP modeling
Proceedings of the 30th conference on Winter simulation
Communications of the ACM
Asynchronous control of discrete event simulation
ANSS '85 Proceedings of the 18th annual symposium on Simulation
Writing simulations from scratch: Pascal implementations
WSC '87 Proceedings of the 19th conference on Winter simulation
Implementations of time (panel)
WSC '86 Proceedings of the 18th conference on Winter simulation
Parallel shared-memory simulator performance for large ATM networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
A detailed interactive simulation system for developing command and control systems
ANSS '83 Proceedings of the 16th annual symposium on Simulation
The design of a multi-microprocessor based simulation computer - II
ANSS '83 Proceedings of the 16th annual symposium on Simulation
Event list management - a tutorial
WSC '83 Proceedings of the 15th conference on Winter Simulation - Volume 2
WSC '81 Proceedings of the 13th conference on Winter simulation - Volume 1
Asynchronous simulation of some discrete time models
WSC '84 Proceedings of the 16th conference on Winter simulation
Channel based sequential simulation
WSC '05 Proceedings of the 37th conference on Winter simulation
P-tree structures and event horizon: efficient event-set implementations
WSC '05 Proceedings of the 37th conference on Winter simulation
Statistical probabilistic model checking with a focus on time-bounded properties
Information and Computation
The event queue problem and PDevs
SpringSim '07 Proceedings of the 2007 spring simulation multiconference - Volume 2
ICCOM'08 Proceedings of the 12th WSEAS international conference on Communications
| Hi-index | 48.26 |
New analytical and empirical results for the performance of future event set algorithms in discrete event simulation are presented. These results provide a clear insight to the factors affecting algorithm performance, permit evaluation of the hold model, and determine the best algorithm(s) to use. The analytical results include a classification of distributions for efficient insertion scanning of a linear structure. In addition, it is shown that when more than one distribution is present, there is generally an increase in the probability that new insertions will have smaller times than those in the future event set. Twelve algorithms, including most of those recently proposed, were empirically evaluated using primarily simulation models. Of the twelve tested, four performed well, three performed fairly, and five performed poorly.