On bounds of response time performance achievable by multiclass single- server queues

DOI10.1007/BF01177549zbMath0818.68039OpenAlexW2293228737MaRDI QIDQ1338906

Astrid R. Rühl

Publication date: 17 August 1995

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01177549

zbMATH Keywords

multiclass \(M/G/1\) systems

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiprocessor systems with reserves and preferences
• Complete parameterized families of job scheduling strategies
• M/G/c Queueing Systems with Multiple Customer Classes: Characterization and Control of Achievable Performance Under Nonpreemptive Priority Rules
• Characterization and Optimization of Achievable Performance in General Queueing Systems
• A Characterization of Waiting Time Performance Realizable by Single-Server Queues
• Sharing a Processor Among Many Job Classes
• Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control
• A conservation law for a wide class of queueing disciplines
• Letter to the Editor—An Alternative Proof of a Conservation Law for the Queue G/G/1
• Work-conserving priorities

This page was built for publication: On bounds of response time performance achievable by multiclass single- server queues