M/G/1/MLPS compared with M/G/1/PS within service time distribution class IMRL

DOI10.1007/S00186-006-0080-6MaRDI QIDQ857944zbMATH OpenOpenAlexFDO

Authors Samuli Aalto

Publication date 5 January 2007

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00186-006-0080-6

zbMATH Keywords

IMRLM/G/1MLPSPSscheduling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• \(M/G/1/MLPS\) compared to \(M/G/1/PS\)
• Recent sojourn time results for multilevel processor‐sharing scheduling disciplines
• On the nonoptimality of the foreground-background discipline for IMRL service times
• The equivalence between processor sharing and service in random order.
• Waiting time distributions for M/M/N processor sharing queues

Cites work

• \(M/G/1/MLPS\) compared to \(M/G/1/PS\)
• A survey on statistical bandwidth sharing
• Bandwidth sharing and admission control for elastic traffic
• scientific article; zbMATH DE number 3562235 (Why is no real title available?)
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• On extremal service disciplines in single-stage queueing systems
• Processor-sharing queues: Some progress in analysis
• Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures

Cited in

(5)

• A Matlab toolkit for the analysis of two-level processor sharing queues
• \(M/G/1/MLPS\) compared to \(M/G/1/PS\)
• On the nonoptimality of the foreground-background discipline for IMRL service times
• Optimal choice of threshold in two level processor sharing
• Processor sharing: a survey of the mathematical theory

This page was built for publication: \(M/G/1/\mathrm{MLPS}\) compared with \(M/G/1/\mathrm{PS}\) within service time distribution class IMRL

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