|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
Weighted Processor Sharing-Results for Hyperexponential Servers
July 1983 (vol. 9 no. 4)
pp. 531-535
| ASCII Text | x | ||
| M.J. Ferguson, "Weighted Processor Sharing-Results for Hyperexponential Servers," IEEE Transactions on Software Engineering, vol. 9, no. 4, pp. 531-535, July, 1983. | |||
| BibTex | x | ||
| @article{ 10.1109/TSE.1983.234962, author = {M.J. Ferguson}, title = {Weighted Processor Sharing-Results for Hyperexponential Servers}, journal ={IEEE Transactions on Software Engineering}, volume = {9}, number = {4}, issn = {0098-5589}, year = {1983}, pages = {531-535}, doi = {http://doi.ieeecomputersociety.org/10.1109/TSE.1983.234962}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Software Engineering TI - Weighted Processor Sharing-Results for Hyperexponential Servers IS - 4 SN - 0098-5589 SP531 EP535 EPD - 531-535 A1 - M.J. Ferguson, PY - 1983 KW - null VL - 9 JA - IEEE Transactions on Software Engineering ER - | |||
In a recent paper by Fayolle, Mitrani, and Iasnogorodski [2], some general multidimensional integral equations were derived in order to solve for the mean response time of each of several classes in a queue whose service discipline was weighted processor sharing. The arrival processes were Poisson. The weighting means that each job within a class k is given an amount of processing proportional to the priority weight gk associated with that class. For exponential service times, the general equations were solved. In this note, a simple observation allows use of the exponential solution directly for the case of hyperexponential servers. As a result, it is possible to state the following. *Characterization of a server in terms of its mean and coefficient of variation is not sufficient to predict even the mean response time for a class using weighted processor sharing. In unweighted or egalitarian processor sharing, only the mean is sufficient. *The Kleinrock conservation law [4] does not hold for nonexponential servers. Fayolie et al. [2] had showed that it did hold for exponential servers.
Citation:
M.J. Ferguson, "Weighted Processor Sharing-Results for Hyperexponential Servers," IEEE Transactions on Software Engineering, vol. 9, no. 4, pp. 531-535, July 1983, doi:10.1109/TSE.1983.234962
Usage of this product signifies your acceptance of the Terms of Use.

