Fluid limits for shortest job first with aging

DOI10.1007/S11134-021-09723-WMaRDI QIDQ2158602zbMATH OpenOpenAlexFDO

Authors Yonatan Shadmi

Publication date 26 July 2022

Published in Queueing Systems (Search for Journal in Brave)

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

zbMATH Keywords

agingfluid limitsmeasure-valued processesshortest job firstmeasure-valued Skorokhod map

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: We investigate fluid scaling of single server queueing systems under the shortest job first with aging (SJFA) scheduling policy. We use the measure-valued Skorokhod map to characterize the fluid limit for SJFA queues with a general aging rule and establish convergence results to the fluid limit. We treat in detail examples of linear and exponential aging.

Recommendations

• Invariance of fluid limits for the shortest remaining processing time and shortest job first policies
• Fluid limits for shortest remaining processing time queues
• Fluid limits for multiple-input shortest remaining processing time queues
• Fluid approximations for a processor-sharing queue
• Diffusion limits for shortest remaining processing time queues

Cites work

• scientific article; zbMATH DE number 1033414 (Why is no real title available?)
• A Proof for the Queuing Formula: L = λW
• A Skorokhod map on measure-valued paths with applications to priority queues
• A delay dependent queue discipline
• A large-deviations analysis of the GI/GI/1 SRPT queue
• Diffusion limits for shortest remaining processing time queues
• Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling
• Fluid limits for shortest remaining processing time queues
• Heavy traffic analysis for EDF queues with reneging
• Invariance of fluid limits for the shortest remaining processing time and shortest job first policies
• Law of large numbers for the many-server earliest-deadline-first queue
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Nonlinear Accumulating Priority Queues with Equivalent Linear Proxies
• Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
• Time Dependent Priority Queues
• Waiting time distributions in the accumulating priority queue

Cited in

(3)

• Fluid limits for earliest-deadline-first networks
• Invariance of fluid limits for the shortest remaining processing time and shortest job first policies
• Fluid limits for shortest remaining processing time queues

This page was built for publication: Fluid limits for shortest job first with aging

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