Optimal choice of threshold in two level processor sharing

DOI10.1007/S10479-008-0430-2MaRDI QIDQ839853zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 3 September 2009

Published in Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

optimizationhyper-exponential job size distributiontwo level processor sharing

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Stochastic scheduling theory in operations research (90B36)

Abstract: We analyze the Two Level Processor Sharing (TLPS) scheduling discipline with the hyper-exponential job size distribution and with the Poisson arrival process. TLPS is a convenient model to study the benefit of the file size based differentiation in TCP/IP networks. In the case of the hyper-exponential job size distribution with two phases, we find a closed form analytic expression for the expected sojourn time and an approximation for the optimal value of the threshold that minimizes the expected sojourn time. In the case of the hyper-exponential job size distribution with more than two phases, we derive a tight upper bound for the expected sojourn time conditioned on the job size. We show that when the variance of the job size distribution increases, the gain in system performance increases and the sensitivity to the choice of the threshold near its optimal value decreases.

Recommendations

• \(M/G/1/MLPS\) compared to \(M/G/1/PS\)
• A Matlab toolkit for the analysis of two-level processor sharing queues
• Large deviations and the generalized processor sharing scheduling for a two-queue system
• \(M/G/1/\mathrm{MLPS}\) compared with \(M/G/1/\mathrm{PS}\) within service time distribution class IMRL
• Batch arrival processor-sharing with application to multi-level processor-sharing scheduling

Cites work

• scientific article; zbMATH DE number 3562235 (Why is no real title available?)
• Analysis of the M/G/1 processor-sharing queue with bulk arrivals
• Batch arrival processor-sharing with application to multi-level processor-sharing scheduling
• Batch processor sharing with hyper-exponential service time
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• On the nonoptimality of the foreground-background discipline for IMRL service times

Cited in

(2)

• A Tale of Two Shares: Why Two-Share Threshold Implementation Seems Worthwhile—and Why It Is Not
• A Matlab toolkit for the analysis of two-level processor sharing queues

This page was built for publication: Optimal choice of threshold in two level processor sharing

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