A survey on discriminatory processor sharing
Queueing systems, 2006•Springer
Abstract 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 gk> 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/j= 1^ K 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.
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 gk> 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/j= 1^ K 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.
Abstract
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 . 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.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果