Generalized processor sharing: Characterization of the admissible region and selection of optimal weights

DOI10.1016/J.COR.2006.12.028zbMath1173.68410OpenAlexW2155411837MaRDI QIDQ2471224

M. R. H. Mandjes, Pascal Lieshout

Publication date: 22 February 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/10868

zbMATH Keywords

generalized processor sharingloss probabilitiespriority schedulingGaussian trafficadmissible regionweight setting

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Traffic problems in operations research (90B20)

Related Items (2)

Analysis of a two-class single-server discrete-time FCFS queue: the effect of interclass correlation ⋮ On the optimization of two-class work-conserving parameterized scheduling policies

Cites Work

• Sample-path large deviations for tandem and priority queues with Gaussian inputs
• Large deviations and the generalized processor sharing scheduling for a multiple-queue system
• A reduced-load equivalence for generalised processor sharing networks with long-tailed input flows
• Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
• Large deviations analysis of the generalized processor sharing policy
• Large Deviations for Complex Buffer Architectures: The Short-Range Dependent Case
• Generalized processor sharing queues with heterogeneous traffic classes

This page was built for publication: Generalized processor sharing: Characterization of the admissible region and selection of optimal weights