Bounded capacity priority queues
โ Scribed by M.D. Atkinson; D. Tulley
- Book ID
- 104326198
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 872 KB
- Volume
- 182
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This paper introduces the Parallel Priority Queue (PPQ) abstract data t:ype. A PPQ stores a set of integer-valued items and provides operations such as insertion of n new items or deletion of the n smallest ones. Algorithms for realizing PPQ operations on an n-proc~or CREW-PPdL.M are based, on two n
In this paper, we propose a new priority discipline, called the (N, n)-preemptive priority discipline. Under this discipline, the preemption of the service of a low-class customer is determined by two thresholds N and n of the queue length of high-class customers. We consider M/G/1 priority queueing