| Author(s): | Randy Brown |
| Title: | Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem |
| Published: | In "Communications of the ACM", pp. 1220-1227, 31 (10), 1988 |
| 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. |
| Contributor: | Holger Füßler |
| Comment: | Formal Description of the ns-2 Calendar Scheduler |
| Download: |  |
| Last Modified: | Data: Tue Dec 16 13:55:03 2003 HTML: Wed Jun 2 12:27:40 2004 |