Abstract
In the discriminatory processor-sharing (DPS) system with a single processor and K job classes, all jobs present in the system are served simultaneously with rates controlled by a vector of weights {gj > 0; j = 1, ⋯ ,K}. When all gi are equal, the DPS system reduces to the egalitarian processor-sharing (PS) system. In this paper we show how the weights of DPS must be chosen in order to make DPS outperform PS.
Original language | English |
---|---|
Pages (from-to) | 558-560 |
Number of pages | 3 |
Journal | IEEE Communications Letters |
Volume | 10 |
Issue number | 7 |
DOIs | |
Publication status | Published - 2006 Jul |
Keywords
- DPS weights
- Discriminatory processor-sharing (DPS)
- Processor-sharing
- Sojourn time
ASJC Scopus subject areas
- Modelling and Simulation
- Computer Science Applications
- Electrical and Electronic Engineering