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

  • Authors:

  • R. Brown

  • Affiliations:

  • -

  • Venue:
  • Communications of the ACM
  • Year:
  • 1988

Quantified Score

Hi-index 48.25

Visualization

Abstract

A new priority queue implementation for the future event set problem is described in this article. The new implementation is shown experimentally to be O(1) in queue size for the priority increment distributions recently considered by Jones in his review article. It displays hold times three times shorter than splay trees for a queue size of 10,000 events. The new implementation, called a calendar queue, is a very simple structure of the multiple list variety using a novel solution to the overflow problem.