A survey on discriminatory processor sharing

被引：59
作者：
Altman, E
Avrachenkov, K
Ayesta, U [1 ]
机构：
[1] CWI, NL-1009 AB Amsterdam, Netherlands
[2] INRIA, Sophia Antipolis, France
来源：
QUEUEING SYSTEMS | 2006年 / 53卷 / 1-2期
关键词：
Discriminatory Processor Sharing; asymptotic analysis; M/G/1; conservation law;
D O I：
10.1007/s11134-006-7586-8
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
The Discriminatory Processor Sharing (DPS) model is a multi-class generalization of the egalitarian Processor Sharing model. In the DPS model all jobs present in the system are served simultaneously at rates controlled by a vector of weights {g(k) > 0; k = 1,..., K}. If there are N-k jobs of class k present in the system, k = 1,..., K, each class-k job is served at rate g(k)/Sigma(K)(j=1) g(j) N-j. The present article provides an overview of the analytical results for the DPS model. In particular, we focus on response times and numbers of jobs in the system.
引用
收藏
页码：53 / 63
页数：11
相关论文
共 52 条
[1]  
ALTMAN E, 2004, P IEEE INFOCOM
[2]  
AVRACHENKOV KE, 2005, P IEEE INFOCOM
[3]  
AVRACHENKOV KE, 2006, UNPUB DISCRIMINATORY
[4]  
Baccelli F, 2013, Elements of Queueing Theory, V26
[5]  
Bach MJ, 1986, DESIGN UNIX OPERATIN
[6]   On stochastic bounds for monotonic processor sharing networks [J].
Bonald, T ;
Proutière, A .
QUEUEING SYSTEMS, 2004, 47 (1-2) :81-106
[7]   Insensitive bandwidth sharing in data networks [J].
Bonald, T ;
Proutière, A .
QUEUEING SYSTEMS, 2003, 44 (01) :69-100
[8]  
Bonald T., 2001, Performance Evaluation Review, V29, P82, DOI 10.1145/384268.378438
[9]   Tail asymptotics for discriminatory processor-sharing queues with heavy-tailed service requirements [J].
Borst, S ;
van Ooteghem, D ;
Zwart, B .
PERFORMANCE EVALUATION, 2005, 61 (2-3) :281-298
[10]  
BOXMA OJ, 2006, IN PRESS AEU INT J E
123456