We present time and work optimal priority queues for the CREW PRAM, supporting FIND I NDMIN IN in constant time with one processor and MAKE AKEQUEUE UEUE, INSERT NSERT, MELD ELD, FIND-IND-MIN I N, EXTRACT XTRACT MIN IN, DELETE ELETE and DECREASE ECREASEKEY EY in constant time with Olog n processors.
On RAM Priority Queues
β Scribed by Thorup, Mikkel
- Book ID
- 118177454
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 2000
- Tongue
- English
- Weight
- 265 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0097-5397
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