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 {g <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">j </sub> >0; j=1,middotmiddotmiddot, K}. When all g <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">j</sub> is 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
