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 |
| id |
ndltd-arizona.edu-oai-arizona.openrepository.com-10150-291354 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-arizona.edu-oai-arizona.openrepository.com-10150-2913542016-03-06T03:00:36Z The calendar heap: A new implementation of the calendar queue Ramsey, Terry, 1946- Sanchez, Paul J. Queuing theory -- Computer programs. Production scheduling -- Computer programs. 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. 1989 text Thesis-Reproduction (electronic) http://hdl.handle.net/10150/291354 http://arizona.openrepository.com/arizona/handle/10150/291354 22747974 1336713 .b17494710 en_US Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author. The University of Arizona. |
| collection |
NDLTD |
| language |
en_US |
| sources |
NDLTD |
| topic |
Queuing theory -- Computer programs. Production scheduling -- Computer programs. |
| spellingShingle |
Queuing theory -- Computer programs. Production scheduling -- Computer programs. Ramsey, Terry, 1946- The calendar heap: A new implementation of the calendar queue |
| description |
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. |
| author2 |
Sanchez, Paul J. |
| author_facet |
Sanchez, Paul J. Ramsey, Terry, 1946- |
| author |
Ramsey, Terry, 1946- |
| author_sort |
Ramsey, Terry, 1946- |
| title |
The calendar heap: A new implementation of the calendar queue |
| title_short |
The calendar heap: A new implementation of the calendar queue |
| title_full |
The calendar heap: A new implementation of the calendar queue |
| title_fullStr |
The calendar heap: A new implementation of the calendar queue |
| title_full_unstemmed |
The calendar heap: A new implementation of the calendar queue |
| title_sort |
calendar heap: a new implementation of the calendar queue |
| publisher |
The University of Arizona. |
| publishDate |
1989 |
| url |
http://hdl.handle.net/10150/291354 http://arizona.openrepository.com/arizona/handle/10150/291354 |
| work_keys_str_mv |
AT ramseyterry1946 thecalendarheapanewimplementationofthecalendarqueue AT ramseyterry1946 calendarheapanewimplementationofthecalendarqueue |
| _version_ |
1718199272686485504 |