Bounded capacity priority queues

DOI10.1016/S0304-3975(96)00149-1zbMATH Open0901.68017OpenAlexW2009144002MaRDI QIDQ1391124FDOQ1391124

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

Recommendations

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

zbMATH Keywords

queueing

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Permutations generated by token passing in graphs
• The permutational power of a priority queue
• Priority Queues and Permutations
• Computing the number of mergings with constraints
• Labelled trees and pairs of input--output permutations in priority queues
• 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
• An N-Server Cutoff Priority Queue
• Permuting machines and priority queues

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)