ACM Home Page
Please provide us with feedback. Feedback
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Full text PdfPdf (1.25 MB)
Source
Communications of the ACM archive
Volume 31 ,  Issue 10  (October 1988) table of contents
Pages: 1220 - 1227  
Year of Publication: 1988
ISSN:0001-0782
Author
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 29,   Downloads (12 Months): 219,   Citation Count: 72
Additional Information:

abstract   references   cited by   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/63039.63045
What is a DOI?

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
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.
5
6
 
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
9
 
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
 
12
Nix, R. An evaluation of pagodas. Res. Rep. 164, Dept. of Computer Science, Yale Univ., New Haven, Conn., no date.
13
 
14
15
16
17

CITED BY  72