Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-26T15:24:01.690Z Has data issue: false hasContentIssue false
  • English
  • Français

RATIO BETWEEN AVERAGE SOJOURN TIMES UNDER PROCESSOR SHARING AND FAIR SOJOURN PROTOCOL

Published online by Cambridge University Press:  19 August 2010

Yingdong Lu
Yingdong Lu
Affiliation:
IBM T.J.Watson Research Center, Yorktown Heights, NY 10598 E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

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