pith. sign in

arxiv: 1712.03853 · v1 · pith:JC4TWNI5new · submitted 2017-12-11 · 🧮 math.PR

Heavy-Traffic Analysis of Sojourn Time under the Foreground-Background Scheduling Policy

classification 🧮 math.PR
keywords analysisdistributionforeground-backgroundpolicyschedulingsojourntimeunder
0
0 comments X
read the original abstract

We consider the steady-state distribution of the sojourn time of a job entering an M/GI/1 queue with the foreground-background scheduling policy in heavy traffic. The growth rate of its mean, as well as the limiting distribution, are derived under broad conditions. Assumptions commonly used in extreme value theory play a key role in both the analysis and the results.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.