Abstract
A queue is a structure into which we can insert items at one end and remove them from the other. It has the property that the next item removed is the one that has been in the container for the longest amount of time. This is called first-in first-out (FIFO) storage. Queues are used internally in computer operating systems to manage many resources, such as current users. Since there is only a single CPU on most systems, only one user process can be active at a time. When the currently executing process gets interrupted, it is put into the user queue (an enqueue operation) and another process is removed (dequeued) and allowed to run. This guarantees that each process gets its turn to execute.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bergin, J. (1998). Dequeue Programming. In: Data Structure Programming. Undergraduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1630-8_6
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1630-8_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7223-6
Online ISBN: 978-1-4612-1630-8
eBook Packages: Springer Book Archive