๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Ordered priority queues

โœ Scribed by Shou-Hsuan Stephen Huang

Book ID
105403765
Publisher
Springer Netherlands
Year
1986
Tongue
English
Weight
393 KB
Volume
26
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Rank order filters and priority queues
Rank order filters and priority queues
โœ Anne Kaldewaij; Jan Tijmen Udding ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 692 KB
Parallel priority queues
Parallel priority queues
โœ Maria Cristina Pinotti; Geppino Pucci ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 475 KB

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

-preemptive priority queues
-preemptive priority queues
โœ Kilhwan Kim ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 500 KB

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

Bounded capacity priority queues
Bounded capacity priority queues
โœ M.D. Atkinson; D. Tulley ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 872 KB