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
关键词
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 条
[11]  
BU T, 2001, P ACM SIGMETRICS 200, P216
[12]  
Cheung S.K., 2005, P ITC 19
[13]   Decomposing the queue length distribution of processor-sharing models into queue lengths of permanent customer queues [J].
Cheung, SK ;
van den Berg, H ;
Boucherie, RJ .
PERFORMANCE EVALUATION, 2005, 62 (1-4) :100-116
[14]   A CHARACTERIZATION OF WAITING TIME PERFORMANCE REALIZABLE BY SINGLE-SERVER QUEUES [J].
COFFMAN, EG ;
MITRANI, I .
OPERATIONS RESEARCH, 1980, 28 (03) :810-821
[15]   SHARING A PROCESSOR AMONG MANY JOB CLASSES [J].
FAYOLLE, G ;
MITRANI, I ;
IASNOGORODSKI, R .
JOURNAL OF THE ACM, 1980, 27 (03) :519-532
[16]  
Feng H., 2003, Performance Evaluation Review, V31, P36, DOI 10.1145/959143.959165
[17]   Sample-path conservation laws, with applications to scheduling queues and fluid systems [J].
Green, TC ;
Stidham, S .
QUEUEING SYSTEMS, 2000, 36 (1-3) :175-199
[18]   ON A RELATIONSHIP BETWEEN PROCESSOR-SHARING QUEUES AND CRUMP-MODE-JAGERS BRANCHING-PROCESSES [J].
GRISHECHKIN, S .
ADVANCES IN APPLIED PROBABILITY, 1992, 24 (03) :653-698
[19]  
GUO L, 2002, P ACM SIGMETRICS, P276
[20]   Who should be given priority in a queue? [J].
Hassin, R ;
Haviv, M .
OPERATIONS RESEARCH LETTERS, 2006, 34 (02) :191-198