Fluid Limits for Shortest Job First with Aging
Yonatan Shadmi
TL;DR
This paper analyzes the fluid limits of single server queues under the shortest job first with aging policy, providing a mathematical characterization of system behavior with general aging rules.
Contribution
It introduces a measure-valued Skorokhod map approach to characterize fluid limits for SJFA queues with various aging functions, including linear and exponential.
Findings
Established convergence to fluid limits for SJFA queues.
Provided detailed examples for linear and exponential aging.
Mathematically characterized the queue dynamics under aging policies.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Queuing Theory Analysis · Scheduling and Optimization Algorithms · Advanced Wireless Network Optimization