The calendar heap: A new implementation of the calendar queue
A new implementation of the calendar queue is described in this thesis. The calendar queue as previously implemented depended upon the use of multiple linked lists for the control of queue discipline. In the calendar heap implementation, the heap has been used to replace the previous functions of th...
Main Author: | |
---|---|
Other Authors: | |
Language: | en_US |
Published: |
The University of Arizona.
1989
|
Subjects: | |
Online Access: | http://hdl.handle.net/10150/291354 http://arizona.openrepository.com/arizona/handle/10150/291354 |
Summary: | A new implementation of the calendar queue is described in this thesis. The calendar queue as previously implemented depended upon the use of multiple linked lists for the control of queue discipline. In the calendar heap implementation, the heap has been used to replace the previous functions of the linked list. Testing of the claim of O(1) execution time for the calendar queue was done. Comparisons of execution times of the calendar queue and the calendar heap have been made. Descriptions of the implementation as well as the complete C code for the calendar heap are included. |
---|