Advertisement

Abstract

Although most queues in everyday life follow the first-in-first-out protocol there are familiar situations where it is acceptable for people to “jump the queue”: for example in a hospital casualty department patients may in general be treated in order of their arrival times, but a severely injured accident victim is certain to be dealt with before someone with a fishbone in the throat no matter at what times they arrived. It is natural to say that the accident victim has higher priority than the patient with the fishbone. There are also situations in the operation of a time-sharing computer system where requests are handled not in the order in which they are made in time but according to the priorities assigned to them by the operating system.

Keywords

Binary Tree Priority Queue Information Item Binary Search Tree Accident Victim 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London Limited 1996

Authors and Affiliations

  • Iain T. Adamson
    • 1
  1. 1.Department of MathematicsUniversity of DundeeDundeeUK

Personalised recommendations