A foreground-background queueing model with speed or capacity modulation
From MaRDI portal
Publication:6135889
DOI10.1016/j.indag.2023.05.005zbMath1520.90081arXiv2112.01058OpenAlexW3216883849MaRDI QIDQ6135889
Publication date: 28 August 2023
Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.01058
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multi-server queueing systems with multiple priority classes
- Processor-sharing queues: Some progress in analysis
- Analysis of nonpreemptive priority queues with multiple servers and two priority classes
- On energy-aware \(M/G/1\)-LAS queue with batch arrivals
- Multi‐Armed Bandit Allocation Indices
- Modeling a Multiprocessor System with Preemptive Priorities
- Speed scaling to manage energy and temperature
- Dynamic Control of a Queue with Adjustable Service Rate
- Waiting Times in the Non-Preemptive Priority M/M/c Queue
- Analysis of a non-preemptive priority multiserver queue
- Multiprocessor systems with preemptive priorities
- On a Preemptive Markovian Queue with Multiple Servers and Two Priority Classes
- Feedback Queueing Models for Time-Shared Systems
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
This page was built for publication: A foreground-background queueing model with speed or capacity modulation
