Bounded capacity priority queues

DOI10.1016/S0304-3975(96)00149-1zbMath0901.68017OpenAlexW2009144002MaRDI QIDQ1391124

D. Massart

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00149-1

zbMATH Keywords

queueing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Sorting with networks of data structures ⋮ Priority queues with binary priorities ⋮ Permuting machines and priority queues

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the number of mergings with constraints
• Labelled trees and pairs of input--output permutations in priority queues
• Transforming binary sequences using priority queues
• Permutations generated by token passing in graphs
• The permutational power of a priority queue
• Priority Queues and Permutations

This page was built for publication: Bounded capacity priority queues