The DOI matches its Crossref record.
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“but to achieve these bounds they need to be balanced”
From Multiresolution Priority Queues (2017) · cites this paper as [8]
In the citing paper
“they also do not support changing the resolution of the priority set to optimize the trade off performance versus accuracy to match the application requirements.”
From Multiresolution Priority Queues (2017) · cites this paper as [8]
In the citing paper
“Calendar queues are for both insert (1) O and remove operations”
From Multiresolution Priority Queues (2017) · cites this paper as [8]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 15
- 10.1145/358800.358805 · doi:10.1145/358800.358805
- Brown M.R, 1978, Implementation and analysis of binomial queue algorithms. SIAM }, Comput., 7, 3
- Davey D., Self-optimizing partitioned sequencing sets for discrete event simulation, Infor, 18, 41
- 10.1109/SFCS.1978.13 · doi:10.1109/sfcs.1978.13
- 10.1145/359763.359801 · doi:10.1145/359763.359801
- 10.1145/359619.359637 · doi:10.1145/359619.359637
- Henriksen J.O., 1977, Proceedings of the 1977 Winter Simulation Conference (Gaithersburg, Md., Dec. 5-7). IEEE, Piscataway, N.J., 547
- 10.1145/5684.5686 · doi:10.1145/5684.5686
- Kingston J. H., 1984, Univ. of Sydney
- 10.1145/358800.358803 · DOI
- 10.1145/800061.808752 · doi:10.1145/800061.808752
- 10.1137/0215004 · DOI
- 10.1145/3828.3835 · DOI · Paper page
- 10.1145/359588.359611 · doi:10.1145/359588.359611
- 10.1145/359460.359478 · DOI
Cited by
Bro: a system for detecting network intruders in real-time
Paxson, V. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00112-7 · Cited by 2,636
Simulation of networks of spiking neurons: A review of tools and strategies
Brette, R., Rudolph, M., Carnevale, T., Hines, M., Beeman, D., Bower, J. M., Diesmann, M., Morrison, A., Goodman, P. H., Harris, F. C., et al. (2007) · Journal of Computational Neuroscience · doi:10.1007/s10827-007-0038-6 · Cited by 822
Operator Scheduling in a Data Stream Manager
Carney, D., Çetintemel, U., Rasin, A., Zdonik, S., Cherniack, M., & Stonebraker, M. (2003) · Proceedings 2003 VLDB Conference · doi:10.1016/b978-012722442-8/50079-3 · Cited by 254
Multiresolution Priority Queues
Ros-Giralt, J., Commike, A., Cullen, P., Lucovsky, J., Madathil, D., & Lethin, R. (2017) · arXiv · Cited by 3
Metadata
- Authors
- Brown, R.
- Venue
- Communications of the ACM
- Published
- 1988-10
- Volume
- 31
- Issue
- 10
- Pages
- 1220-1227
- ISSN
- 0001-0782
- 1557-7317
- Cited by
- 275
- References
- 0
- Language
- en
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem. https://app.cochat.ai/papers/10.1145/63039.63045
- The paper
- Brown, R. (1988). Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem. Communications of the ACM. https://doi.org/10.1145/63039.63045
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.