✦ LIBER ✦

A Particular Two-Priority Queue

✍ Scribed by Alan Washburn

Book ID: 123685973
Publisher: INFORMS
Year: 1971
Tongue: English
Weight: 172 KB
Volume: 19
Category: Article
ISSN: 0030-364X
DOI: 10.2307/169198

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Two Priority Queue with Crossover Feed

A Two Priority Queue with Crossover Feedback

✍ E.M. Jewkes; D.A. Stanford 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 137 KB

A two-queue, one-server model with prior

A two-queue, one-server model with priority for the longer queue

✍ J. W. Cohen 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 732 KB

Two new methods for constructing double-

Two new methods for constructing double-ended priority queues from priority queues

✍ Amr Elmasry; Claus Jensen; Jyrki Katajainen 📂 Article 📅 2008 🏛 Springer Vienna 🌐 English ⚖ 718 KB

Closed two node priority queueing networ

Closed two node priority queueing networks

✍ M. Rumsewicz; W. Henderson 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 836 KB

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

A Priority Queue with Low-Priority Arriv

A Priority Queue with Low-Priority Arrivals General

✍ John A. Hooke 📂 Article 📅 1972 🏛 INFORMS 🌐 English ⚖ 294 KB