No CrossRef data available.
Article contents
RATIO BETWEEN AVERAGE SOJOURN TIMES UNDER PROCESSOR SHARING AND FAIR SOJOURN PROTOCOL
Published online by Cambridge University Press: 19 August 2010
Abstract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.
Under very general assumptions, we prove that the ratio between the average sojourn time in a queue under the processor sharing (PS) and the same queue under the fair sojourn protocol (FSP) can be bounded above, and we derive such a bound in terms of the long-run average system size of the PS queue seen by arrivals.
Information
- Type
- Research Article
- Information
- Probability in the Engineering and Informational Sciences , Volume 24 , Issue 4 , October 2010 , pp. 485 - 490
- Copyright
- Copyright © Cambridge University Press 2010
References
1.Friedman, E.J. & Henderson, S.G. (2003). Fairness and efficieny in web server protocols. Proceedings of ACM/SIGMETRIC’03.Google Scholar
2.Wierman, A. & Harchol-Balter, M. (2003). Bounds on a fair policy with near optimal performance. Technical report, Pittsburg: Cornegie Mellon University.Google Scholar
You have
Access