@inproceedings{frihen03,
	abstract = {We consider the problem of designing a preemptive protocol that is both fair and efficient when one is only concerned with the sojourn time of the job and not intermediate results. Our Fair Sojourn Protocol (FSP) is both efficient, in a strong sense (similar to the shortest remaining processing time protocol: SRPT), and fair, in the sense of guaranteeing that it weakly outperforms processor sharing (PS) for every job on any sample path.
Our primary motivation is web serving in which the standard protocol is PS, while recent work proposes using SRPT or variants. Our work suggests both a framework in which to evaluate proposed protocols and an attractive new protocol, FSP.},
	annote = {pubs/FSPSigmetrics.pdf},
	author = {Eric J. Friedman and Shane G. Henderson},
	booktitle = {Proceedings of the 2003 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems},
	date-added = {2016-01-10 16:07:54 +0000},
	date-modified = {2018-07-16 17:39:04 +0000},
	doi = {http://doi.acm.org/10.1145/781027.781056},
	isbn = {1-518813-664-1},
	location = {San Diego, CA, USA},
	pages = {229--237},
	publisher = {ACM Press},
	title = {Fairness and efficiency in web server protocols},
	url_paper = {https://dl.acm.org/authorize?N654070},
	year = {2003},
	bdsk-url-1 = {http://doi.acm.org/10.1145/781027.781056}}

{"_id":"Gqk9G3hhZ8fwMQm2c","bibbaseid":"friedman-henderson-fairnessandefficiencyinwebserverprotocols-2003","downloads":0,"creationDate":"2016-01-10T16:41:19.177Z","title":"Fairness and efficiency in web server protocols","author_short":["Friedman, E. J.","Henderson, S. G."],"year":2003,"bibtype":"inproceedings","biburl":"https://people.orie.cornell.edu/shane/ShanePubs.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"We consider the problem of designing a preemptive protocol that is both fair and efficient when one is only concerned with the sojourn time of the job and not intermediate results. Our Fair Sojourn Protocol (FSP) is both efficient, in a strong sense (similar to the shortest remaining processing time protocol: SRPT), and fair, in the sense of guaranteeing that it weakly outperforms processor sharing (PS) for every job on any sample path. Our primary motivation is web serving in which the standard protocol is PS, while recent work proposes using SRPT or variants. Our work suggests both a framework in which to evaluate proposed protocols and an attractive new protocol, FSP.","annote":"pubs/FSPSigmetrics.pdf","author":[{"firstnames":["Eric","J."],"propositions":[],"lastnames":["Friedman"],"suffixes":[]},{"firstnames":["Shane","G."],"propositions":[],"lastnames":["Henderson"],"suffixes":[]}],"booktitle":"Proceedings of the 2003 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems","date-added":"2016-01-10 16:07:54 +0000","date-modified":"2018-07-16 17:39:04 +0000","doi":"http://doi.acm.org/10.1145/781027.781056","isbn":"1-518813-664-1","location":"San Diego, CA, USA","pages":"229–237","publisher":"ACM Press","title":"Fairness and efficiency in web server protocols","url_paper":"https://dl.acm.org/authorize?N654070","year":"2003","bdsk-url-1":"http://doi.acm.org/10.1145/781027.781056","bibtex":"@inproceedings{frihen03,\n\tabstract = {We consider the problem of designing a preemptive protocol that is both fair and efficient when one is only concerned with the sojourn time of the job and not intermediate results. Our Fair Sojourn Protocol (FSP) is both efficient, in a strong sense (similar to the shortest remaining processing time protocol: SRPT), and fair, in the sense of guaranteeing that it weakly outperforms processor sharing (PS) for every job on any sample path.\nOur primary motivation is web serving in which the standard protocol is PS, while recent work proposes using SRPT or variants. Our work suggests both a framework in which to evaluate proposed protocols and an attractive new protocol, FSP.},\n\tannote = {pubs/FSPSigmetrics.pdf},\n\tauthor = {Eric J. Friedman and Shane G. Henderson},\n\tbooktitle = {Proceedings of the 2003 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems},\n\tdate-added = {2016-01-10 16:07:54 +0000},\n\tdate-modified = {2018-07-16 17:39:04 +0000},\n\tdoi = {http://doi.acm.org/10.1145/781027.781056},\n\tisbn = {1-518813-664-1},\n\tlocation = {San Diego, CA, USA},\n\tpages = {229--237},\n\tpublisher = {ACM Press},\n\ttitle = {Fairness and efficiency in web server protocols},\n\turl_paper = {https://dl.acm.org/authorize?N654070},\n\tyear = {2003},\n\tbdsk-url-1 = {http://doi.acm.org/10.1145/781027.781056}}\n\n","author_short":["Friedman, E. J.","Henderson, S. G."],"key":"frihen03","id":"frihen03","bibbaseid":"friedman-henderson-fairnessandefficiencyinwebserverprotocols-2003","role":"author","urls":{" paper":"https://dl.acm.org/authorize?N654070"},"metadata":{"authorlinks":{"henderson, s":"https://people.orie.cornell.edu/shane/"}},"downloads":0},"search_terms":["fairness","efficiency","web","server","protocols","friedman","henderson"],"keywords":[],"authorIDs":["Rzrm76FFjE8xtscXR"],"dataSources":["ZCuKDjctePZJeeaBw","SEqonpKnx4miWre2P"]}