By Topic

Optimizing static calendar queues

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Erickson, K.B. ; Washington Univ., Seattle, WA, USA ; Ladner, R.E. ; LaMarca, Anthony

The calendar queue is an important implementation of a priority queue which is particularly useful in discrete event simulators. In this paper we present an analysis of the static calendar queue which maintains N active events. A step of the discrete event simulator removes and processes the event with the smallest associated time and inserts a new event whose associated time is the time of the removed event plus a random increment with mean μ. We demonstrate that for the infinite bucket calendar queue the optimal bucket width is approximately δopt=√(2b/c)μ/N where b is the time to process an empty bucket and c the incremental time to process a list element. With bucket width chosen to be δopt, the expected time to process an event is approximately minimized at the constant c+√(2bc)+d, where d is the fixed time to process an event. We show that choosing the number of buckets to be O(N) yields a calendar queue with performance equal to or almost equal to the performance of the infinite bucket calendar queue

Published in:

Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on

Date of Conference:

20-22 Nov 1994