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

Analysis of an algorithm for priority queue administration

โœ Scribed by Arne Jonassen; Ole-Johan Dahl

Publisher
Springer Netherlands
Year
1975
Tongue
English
Weight
693 KB
Volume
15
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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