Bounded capacity priority queues

DOI10.1016/S0304-3975(96)00149-1MaRDI QIDQ1391124zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Priority queues with binary priorities
• Transforming binary sequences using priority queues
• Priority Queues and Permutations
• Priority queues and multisets

Cites work

• scientific article; zbMATH DE number 51878 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3390782 (Why is no real title available?)
• Computing the number of mergings with constraints
• Labelled trees and pairs of input--output permutations in priority queues
• Permutations generated by token passing in graphs
• Priority Queues and Permutations
• The permutational power of a priority queue
• Transforming binary sequences using priority queues

Cited in

(7)

• Priority queues with semi-exhaustive service
• Priority queue sorting and labeled trees
• Sorting with networks of data structures
• Transforming binary sequences using priority queues
• Priority queues with binary priorities
• Permuting machines and priority queues
• An N-Server Cutoff Priority Queue

This page was built for publication: Bounded capacity priority queues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1391124)