article

Free access

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

Author:

R. BrownAuthors Info & Claims

Communications of the ACM, Volume 31, Issue 10

Pages 1220 - 1227

https://doi.org/10.1145/63039.63045

Published: 01 October 1988 Publication History

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.

References

[1]

Blackstone, J.H., Hogg, G.L., and Phillips, D.T. A two-list synchronization procedure for discrete event simulation. Commun. ACM 24, 12 (Dec. 1981), 825-829.

Digital Library

[2]

Brown, M.R. Implementation and analysis of binomial queue algorithms. SIAM }. Comput. 7, 3 (Aug. 1978), 298-319.

[3]

Davey, D., and Vaucher, J. Self-optimizing partitioned sequencing sets for discrete event simulation. Infor 18, I (Feb. 1980), 41-61.

[4]

Francon, J., Viennot, G., and Vuillemin, J. Description and analysis of an efficient priority queue representation. In Proceedings of the 19th Annual Symposium on Foundations of Computer Science (Ann Arbor, Mich., Oct. 16-18}. IEEE, Piscataway, N.J., 1978, pp. 1-7.

Digital Library

[5]

Franta, W.R., and Maly, K. An efficient data structure for the simulation event set. Commun. ACM 20, 8 {Aug. 1977), 596-602.

Digital Library

[6]

Franta, W.R., and Maly, K. A comparison of heaps and the TL structure for the simulation event set. Commun. ACM 21, 10 (Oct. 1978}, 873-875.

Digital Library

[7]

Fredman, M.L., Sedgewick, R., Sleator, D., and Tarjan, R. The pairing heap: A new form of self-adjusting heap. Submitted for publication.

[8]

Henriksen, J.O. An improved events list algorithm. In Proceedings of the 1977 Winter Simulation Conference (Gaithersburg, Md., Dec. 5-7). IEEE, Piscataway, N.J., 1977, pp. 547-557.

Digital Library

[9]

Jones, D.W. An empirical comparison of priority-queue and eventset implementations. Commun. ACM 29, 4 (Apr. 1986), 300-311.

Digital Library

[10]

Kingston, J. H. Analysis of algorithms for the simulation event list. Ph.D. thesis, Basser Dept. of Computer Science, Univ. of Sydney, Australia, July 1984.

[11]

McCormack, W.M., and Sargent, R.G. Analysis of future event-set algorithms for discrete event simulation. Commun. ACM 24, 12 (Dec. 1981), 801-812.

Digital Library

[12]

Nix, R. An evaluation of pagodas. Res. Rep. 164, Dept. of Computer Science, Yale Univ., New Haven, Conn., no date.

[13]

Sleator, D.D., and Tarjan, R.E. Self-adjusting binary trees. In Proceedings of the ACM SIGACT Symposium on Theory of Computing (Boston, Mass., Apr. 25-27). ACM, New York, 1983, pp. 235-245.

Digital Library

[14]

Sleator, D.D., and Tarjan, R,E. Self adjusting heaps. SIAM J. Comput. To be published.

Digital Library

[15]

Tarjan, R.E., and Sleator, D.D. Self-adjusting binary search trees. J. ACM 32, 3 (}uly 1985)~ 652-686.

Digital Library

[16]

Ulrich, E.G. Event manipulation for discrete simulations requiring large numbers of events. Commun. ACM 21, 9 (Sept. 1978), 777-785.

Digital Library

[17]

Vuillemin, J. A data structure for manipulating priority queues. Commun. ACM 21, 4 (Apr. 1978), 309-315.

Digital Library

Cited By

Marotta RIanni MPellegrini AQuaglia F(2024)A Conflict-Resilient Lock-Free Linearizable Calendar QueueACM Transactions on Parallel Computing10.1145/363516311:1(1-32)Online publication date: 11-Mar-2024
https://dl.acm.org/doi/10.1145/3635163
Guo FSun SHu JZhang NLv Z(2024)CIPO: Efficient, lightweight and programmable packet schedulingComputer Networks10.1016/j.comnet.2024.110355245(110355)Online publication date: May-2024
https://doi.org/10.1016/j.comnet.2024.110355
Song JLiu JGao PLiu GChao H(2024)Inversion impact of approximate PIFO to Start-Time Fair QueueingComputer Networks10.1016/j.comnet.2023.110164240(110164)Online publication date: Feb-2024
https://doi.org/10.1016/j.comnet.2023.110164
Show More Cited By

Index Terms

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

Recommendations

The Queue M/G/1 With Feedback to Lower Priority Queues

The queue M/G/1 with a round-robin type queueing discipline is considered. The overall processing time of a job is assumed to consist of a sequence of “simple” processing times. There are a countably infinite number of waiting queues, 1,2,..., but a ...
Read More
Queue Length Dependent Priority Queues

Priority rules that are mixtures of pre-emption and postponable rules are analyzed. Whether a pre-emption occurs is made to depend on some factor in addition to priority class. A lower priority customer is pre-empted if and only if the queue length of ...
Read More
GI/M/1 Priority Queue

We consider customers arriving at a service facility from a finite number of priority classes and being served according to a common negative exponential distribution with mean 1/µ. The priority discipline is preemptive, i.e., an arriving customer of ...
Read More

Comments

Information & Contributors

Information

Published In

cover image Communications of the ACM

Communications of the ACM Volume 31, Issue 10

Oct. 1988

66 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/63039

Editor:
Peter J. Denning
NASA Ames Research Center, Moffett Field, CA

Issue’s Table of Contents

Copyright © 1988 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1988

Published in CACM Volume 31, Issue 10

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

348
Total Citations
View Citations
4,380
Total Downloads

Downloads (Last 12 months)414
Downloads (Last 6 weeks)28

Other Metrics

View Author Metrics

Citations

Cited By

Marotta RIanni MPellegrini AQuaglia F(2024)A Conflict-Resilient Lock-Free Linearizable Calendar QueueACM Transactions on Parallel Computing10.1145/363516311:1(1-32)Online publication date: 11-Mar-2024
https://dl.acm.org/doi/10.1145/3635163
Guo FSun SHu JZhang NLv Z(2024)CIPO: Efficient, lightweight and programmable packet schedulingComputer Networks10.1016/j.comnet.2024.110355245(110355)Online publication date: May-2024
https://doi.org/10.1016/j.comnet.2024.110355
Song JLiu JGao PLiu GChao H(2024)Inversion impact of approximate PIFO to Start-Time Fair QueueingComputer Networks10.1016/j.comnet.2023.110164240(110164)Online publication date: Feb-2024
https://doi.org/10.1016/j.comnet.2023.110164
Ryu JTrager SWilkinson M(2023)A Fast Alpha-tree Algorithm for Extreme Dynamic Range Pixel DissimilaritiesIEEE Transactions on Pattern Analysis and Machine Intelligence10.1109/TPAMI.2023.3341721(1-14)Online publication date: 2023
https://doi.org/10.1109/TPAMI.2023.3341721
Andelfinger PCai W(2022)Advanced TutorialProceedings of the Winter Simulation Conference10.5555/3586210.3586232(268-282)Online publication date: 11-Dec-2022
https://dl.acm.org/doi/10.5555/3586210.3586232
Piccione A(2022)Comparing Different Event Set Management Strategies in Speculative PDESProceedings of the 2022 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation10.1145/3518997.3534993(55-56)Online publication date: 8-Jun-2022
https://dl.acm.org/doi/10.1145/3518997.3534993
Madden LSimonetto A(2022)Best Approximate Quantum Compiling ProblemsACM Transactions on Quantum Computing10.1145/35051813:2(1-29)Online publication date: 4-Mar-2022
https://dl.acm.org/doi/10.1145/3505181
Wu XZhang BChen GJin D(2022)A Scalable Quantum Key Distribution Network Testbed Using Parallel Discrete-Event SimulationACM Transactions on Modeling and Computer Simulation10.1145/349002932:2(1-22)Online publication date: 4-Mar-2022
https://dl.acm.org/doi/10.1145/3490029
Vu MXu LElbaum SSun WQiao K(2022)Efficient Protocol Testing Under Temporal Uncertain Event Using Discrete-event Network SimulationsACM Transactions on Modeling and Computer Simulation10.1145/349002832:2(1-30)Online publication date: 4-Mar-2022
https://dl.acm.org/doi/10.1145/3490028
Babu VNicol D(2022)Mechanisms for Precise Virtual Time Advancement in Network EmulationACM Transactions on Modeling and Computer Simulation10.1145/347886732:2(1-26)Online publication date: 4-Mar-2022
https://dl.acm.org/doi/10.1145/3478867
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents