✦ LIBER ✦

The efficiency of two indexed priority queue algorithms

✍ Scribed by Olli Nevalainen; Jukka Teuhola

Publisher: Springer Netherlands
Year: 1978
Tongue: English
Weight: 753 KB
Volume: 18
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01930901

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

Analysis of an algorithm for priority qu

Analysis of an algorithm for priority queue administration

✍ Arne Jonassen; Ole-Johan Dahl 📂 Article 📅 1975 🏛 Springer Netherlands 🌐 English ⚖ 693 KB

Performance analysis of the priority que

Performance analysis of the priority queues for the load-building algorithms

✍ Anna Hać 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 682 KB

On the bias vector of a two-class preemp

On the bias vector of a two-class preemptive priority queue

✍ Robin Groenevelt; Ger Koole; Philippe Nain 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 122 KB

The permutational power of a priority qu

The permutational power of a priority queue

✍ M. D. Atkinson; Murali Thiyagarajah 📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 298 KB

Efficiency of combining various priority

Efficiency of combining various priority queueing disciplines in computer systems

✍ A. I. Kostogryzov 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 699 KB