𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Concurrent access of priority queues

✍ Scribed by Nageshwara, R.V.; Kumar, V.

Book ID
119773308
Publisher
IEEE
Year
1988
Tongue
English
Weight
955 KB
Volume
37
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Highly Concurrent Priority Queue
A Highly Concurrent Priority Queue
✍ T. Johnson πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 657 KB

We present a highly concurrent priority queue algorithm based on the B-link tree, which is a \(\mathrm{B}^{+}\)-tree in which every node has a pointer to its right sibling. The algorithm is built on the concurrent B-link tree algorithms. Since the priority queue is based on highly concurrent search

An efficient algorithm for concurrent pr
An efficient algorithm for concurrent priority queue heaps
✍ Galen C. Hunt; Maged M. Michael; Srinivasan Parthasarathy; Michael L. Scott πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 628 KB

We present a new algorithm for concurrent access to array-based priority queue heaps. Deletions proceed top-down as they do in a previous algorithm due to , but insertions proceed bottom-up, and consecutive insertions use a bit-reversal technique to scatter accesses across the fringe of the tree, to