An empirical comparison of priority-queue and event-set implementations

Authors:
Douglas W. Jones
Affiliations:
Univ. of Iowa, Iowa City
Venue:
Communications of the ACM
Year:
1986

Citing 14
Cited 67

Self-adjusting binary search trees

Journal of the ACM (JACM)
Analysis of tree algorithms for the simulation event list

Acta Informatica
Self adjusting heaps

SIAM Journal on Computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Programming pearls: thanks, heaps

Communications of the ACM
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
A data structure for manipulating priority queues

Communications of the ACM
A comparison of heaps and the TL structure for the simulation event set

Communications of the ACM
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Event list management - a tutorial

WSC '83 Proceedings of the 15th conference on Winter Simulation - Volume 2
The development of the General Purpose Simulation System (GPSS)

ACM SIGPLAN Notices - Special issue: History of programming languages conference
Self-adjusting binary trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
An improved events list algorithm

WSC '77 Proceedings of the 9th conference on Winter simulation - Volume 2

Parallel discrete-event simulation of FCFS stochastic queueing networks

PPEALS '88 Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems
Application of splay trees to data compression

Communications of the ACM
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem

Communications of the ACM
Concurrent operations on priority queues

Communications of the ACM
The virtual time machine

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
FCFS: a novel scheduling policy for tightly-coupled parallel computer systems

CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Analysis of synchronization in massively parallel discrete-event simulations

PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
The virtual machine

ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
A comparative performance evaluation of write barrier implementation

OOPSLA '92 conference proceedings on Object-oriented programming systems, languages, and applications
The cost of conservative synchronization in parallel discrete event simulations

Journal of the ACM (JACM)
Efficient implementation of event sets in Time Warp

PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
Simulation through explicit state description and its application to semiconductor fab operation

WSC '92 Proceedings of the 24th conference on Winter simulation
Discrete-event simulation and the event horizon

PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
A static partitioning and mapping algorithm for conservative parallel simulations

PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
Pairing heaps: experiments and analysis

Communications of the ACM
Performance analysis of future event sets

WSC '95 Proceedings of the 27th conference on Winter simulation
Infrastructure for rapid execution of strike-planning systems

WSC '95 Proceedings of the 27th conference on Winter simulation
The influence of caches on the performance of heaps

Journal of Experimental Algorithmics (JEA)
Discrete-event simulation and the event horizon part 2: event list management

PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
Packet network simulation: speedup and accuracy versus timing granularity

IEEE/ACM Transactions on Networking (TON)
A comparative study of parallel and sequential priority queue algorithms

ACM Transactions on Modeling and Computer Simulation (TOMACS)
A generalized hold model

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
Weight-biased leftist trees and modified skip lists

Journal of Experimental Algorithmics (JEA)
Lock bypassing: an efficient algorithm for concurrently accessing priority heaps

Journal of Experimental Algorithmics (JEA)
Lazy queue: an efficient implementation of the pending-event set

ANSS '91 Proceedings of the 24th annual symposium on Simulation
Using split event sets to form and schedule event combinations in discrete event simulation

ANSS '92 Proceedings of the 25th annual symposium on Simulation
Technical correspondence

Communications of the ACM
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
Concurrent simulation: an alternative to distributed simulation

WSC '86 Proceedings of the 18th conference on Winter simulation
Correspondence-based data structures for double-ended priority queues

Journal of Experimental Algorithmics (JEA)
Fast priority queues for cached memory

Journal of Experimental Algorithmics (JEA)
Cache oblivious search trees via binary trees of small height

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
High-Performance Algorithm Engineering for Computational Phylogenetics

The Journal of Supercomputing - Special issue on computational issues in fluid dynamics optimization and simulation
High-Performance Algorithm Engineering for Computational Phylogenetics

ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Fast Priority Queues for Cached Memory

ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Randomized Meldable Priority Queues

SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
A Priority Queue Transform

WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Multiprocess Time Queue

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Dynamic Lazy Calendar Queue: An Event List for Network Simulation

HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Inductive benchmarking for purely functional data structures

Journal of Functional Programming
Reducing null messages overhead through load balancing in conservative distributed simulation systems

Journal of Parallel and Distributed Computing
Time warp - connection oriented

Proceedings of the eighteenth workshop on Parallel and distributed simulation
Parameterized self-adjusting heaps

Journal of Algorithms
Twol-amalgamated priority queues

Journal of Experimental Algorithmics (JEA)
The d-deap: a fast and simple cache-aligned d-ary deap

Information Processing Letters
Parallel simulation on the hypercube multiprocessor

Distributed Computing
Ladder queue: An O(1) priority queue structure for large-scale discrete event simulation

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Independent Variable Time-Step Integration of Individual Neurons for Network Simulations

Neural Computation
Channel based sequential simulation

WSC '05 Proceedings of the 37th conference on Winter simulation
A Complexity O(1) priority queue for event driven molecular dynamics simulations

Journal of Computational Physics
A package for exact kinetic data structures and sweepline algorithms

Computational Geometry: Theory and Applications
Using SIMD registers and instructions to enable instruction-level parallelism in sorting algorithms

Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Pipelined heap (priority queue) management for advanced scheduling in high-speed networks

IEEE/ACM Transactions on Networking (TON)
When to use splay trees

Software—Practice & Experience
The event queue problem and PDevs

SpringSim '07 Proceedings of the 2007 spring simulation multiconference - Volume 2
Pairing heaps with O(log log n) decrease cost

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Performance Measurement of Dynamic Structure DEVS for Large-Scale Cellular Space Models

Simulation
The d-deap*: a fast and simple cache-aligned d-ary deap

Information Processing Letters
Revisiting priority queues for image analysis

Pattern Recognition
Pairing heaps with costless meld

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Automating the runtime performance evaluation of simulation algorithms

Winter Simulation Conference
Experimental analysis of logical process simulation algorithms in JAMES II

Winter Simulation Conference
Time warp on the go

Proceedings of the 5th International ICST Conference on Simulation Tools and Techniques
Parallel discrete event simulation with Erlang

Proceedings of the 1st ACM SIGPLAN workshop on Functional high-performance computing
Shared hardware data structures for hard real-time systems

Proceedings of the tenth ACM international conference on Embedded software

Quantified Score

Hi-index	48.30

Visualization

Abstract

Execution times for a variety of priority-queue implementations are compared under the hold model, showing many to be faster than implicit heaps.