A foreground-background queueing model with speed or capacity modulation

DOI10.1016/J.INDAG.2023.05.005MaRDI QIDQ6135889zbMATH OpenOpenAlexFDO

Authors Andrea Marin, I. Mitrani

Publication date 28 August 2023

Published in Indagationes Mathematicae. New Series (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/2112.01058

zbMATH Keywords

optimizationMarkov processesqueues

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Abstract: The models studied in the steady state involve two queues which are served either by a single server whose speed depends on the number of jobs present, or by several parallel servers whose number may be controlled dynamically. Job service times have a two-phase Coxian distribution and the second phase is given lower priority than the first. The trade-offs between holding costs and energy consumption costs are examined by means of a suitable cost functions. Two different two-dimensional Markov process are solved exactly. The solutions are used in several numerical experiments. Some counter-intuitive results are observed.

Recommendations

• An \(M/ PH /1\) queue with workload-dependent processing speed and vacations
• A \(MAP_{K}/G_{K}/1/\infty\) queueing system with generalized foreground-background processor sharing discipline
• The steady-state distribution of spent service times present in theM/G/1 foreground–background processor-sharing queue
• A single server queue with workload-dependent service speed and vacations
• A finite capacity \(BMAPK/GK/1\) queue with the generalized foreground-background processor-sharing discipline

Cites work

• scientific article; zbMATH DE number 3113174 (Why is no real title available?)
• scientific article; zbMATH DE number 3562235 (Why is no real title available?)
• scientific article; zbMATH DE number 1306870 (Why is no real title available?)
• Analysis of a non-preemptive priority multiserver queue
• Analysis of nonpreemptive priority queues with multiple servers and two priority classes
• Dynamic Control of a Queue with Adjustable Service Rate
• Feedback Queueing Models for Time-Shared Systems
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Modeling a Multiprocessor System with Preemptive Priorities
• Multi-armed bandit allocation indices. With a foreword by Peter Whittle.
• Multi-server queueing systems with multiple priority classes
• Multiprocessor systems with preemptive priorities
• On a Preemptive Markovian Queue with Multiple Servers and Two Priority Classes
• On energy-aware \(M/G/1\)-LAS queue with batch arrivals
• Processor-sharing queues: Some progress in analysis
• Speed scaling to manage energy and temperature
• Speed scaling with an arbitrary power function
• The SRPT service policy with frequency scaling: modeling, evaluation and optimization
• Waiting Times in the Non-Preemptive Priority M/M/c Queue

Cited in

(1)

• A QUEUEING MODEL WITH INPUT OF MPEG FRAME SEQUENCE AND INTERFERING TRAFFIC

This page was built for publication: A foreground-background queueing model with speed or capacity modulation

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