Persistent Link:
http://hdl.handle.net/10150/291354
Title:
The calendar heap: A new implementation of the calendar queue
Author:
Ramsey, Terry, 1946-
Issue Date:
1989
Publisher:
The University of Arizona.
Rights:
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.
Abstract:
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.
Type:
text; Thesis-Reproduction (electronic)
Keywords:
Queuing theory -- Computer programs.; Production scheduling -- Computer programs.
Degree Name:
M.S.
Degree Level:
masters
Degree Program:
Graduate College; Systems and Industrial Engineering
Degree Grantor:
University of Arizona
Advisor:
Sanchez, Paul J.

Full metadata record

DC FieldValue Language
dc.language.isoen_USen_US
dc.titleThe calendar heap: A new implementation of the calendar queueen_US
dc.creatorRamsey, Terry, 1946-en_US
dc.contributor.authorRamsey, Terry, 1946-en_US
dc.date.issued1989en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © 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.en_US
dc.description.abstractA 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.en_US
dc.typetexten_US
dc.typeThesis-Reproduction (electronic)en_US
dc.subjectQueuing theory -- Computer programs.en_US
dc.subjectProduction scheduling -- Computer programs.en_US
thesis.degree.nameM.S.en_US
thesis.degree.levelmastersen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.disciplineSystems and Industrial Engineeringen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.advisorSanchez, Paul J.en_US
dc.identifier.proquest1336713en_US
dc.identifier.oclc22747974en_US
dc.identifier.bibrecord.b17494710en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.