@techreport{frihen02,
	abstract = {We present a new scheduling protocol that we call the ``starvation avoidance protocol'' (SAP). SAP is designed for situations in which users primarily care about the completion time of a job, such as web serving. SAP is similar to the shortest remaining processing time (SRPT) protocol in that small jobs typically receive priority. However, unlike SRPT, SAP has a safeguarding feature that ensures that large jobs cannot be starved indefinitely. In particular, SAP guarantees that every job completes at least as early as it would under processor sharing (PS), a common web serving protocol. Indeed, SAP is strictly better than PS for every nonterminal job during a busy period. Thus, SAP provides an attractive protocol for web servers.},
	address = {Ithaca NY},
	author = {E. J. Friedman and S. G. Henderson},
	date-added = {2016-01-10 19:38:59 +0000},
	date-modified = {2016-01-10 19:40:01 +0000},
	institution = {ORIE, Cornell University},
	title = {SAP: An efficient scheduling protocol for web servers},
	url_paper = {pubs/sap.pdf},
	year = {2002}}

{"_id":"9sBv4JzcQtDNmkRxD","bibbaseid":"friedman-henderson-sapanefficientschedulingprotocolforwebservers-2002","downloads":0,"creationDate":"2016-01-10T19:51:51.461Z","title":"SAP: An efficient scheduling protocol for web servers","author_short":["Friedman, E. J.","Henderson, S. G."],"year":2002,"bibtype":"techreport","biburl":"https://people.orie.cornell.edu/shane/ShanePubs.bib","bibdata":{"bibtype":"techreport","type":"techreport","abstract":"We present a new scheduling protocol that we call the ``starvation avoidance protocol'' (SAP). SAP is designed for situations in which users primarily care about the completion time of a job, such as web serving. SAP is similar to the shortest remaining processing time (SRPT) protocol in that small jobs typically receive priority. However, unlike SRPT, SAP has a safeguarding feature that ensures that large jobs cannot be starved indefinitely. In particular, SAP guarantees that every job completes at least as early as it would under processor sharing (PS), a common web serving protocol. Indeed, SAP is strictly better than PS for every nonterminal job during a busy period. Thus, SAP provides an attractive protocol for web servers.","address":"Ithaca NY","author":[{"firstnames":["E.","J."],"propositions":[],"lastnames":["Friedman"],"suffixes":[]},{"firstnames":["S.","G."],"propositions":[],"lastnames":["Henderson"],"suffixes":[]}],"date-added":"2016-01-10 19:38:59 +0000","date-modified":"2016-01-10 19:40:01 +0000","institution":"ORIE, Cornell University","title":"SAP: An efficient scheduling protocol for web servers","url_paper":"pubs/sap.pdf","year":"2002","bibtex":"@techreport{frihen02,\n\tabstract = {We present a new scheduling protocol that we call the ``starvation avoidance protocol'' (SAP). SAP is designed for situations in which users primarily care about the completion time of a job, such as web serving. SAP is similar to the shortest remaining processing time (SRPT) protocol in that small jobs typically receive priority. However, unlike SRPT, SAP has a safeguarding feature that ensures that large jobs cannot be starved indefinitely. In particular, SAP guarantees that every job completes at least as early as it would under processor sharing (PS), a common web serving protocol. Indeed, SAP is strictly better than PS for every nonterminal job during a busy period. Thus, SAP provides an attractive protocol for web servers.},\n\taddress = {Ithaca NY},\n\tauthor = {E. J. Friedman and S. G. Henderson},\n\tdate-added = {2016-01-10 19:38:59 +0000},\n\tdate-modified = {2016-01-10 19:40:01 +0000},\n\tinstitution = {ORIE, Cornell University},\n\ttitle = {SAP: An efficient scheduling protocol for web servers},\n\turl_paper = {pubs/sap.pdf},\n\tyear = {2002}}\n\n","author_short":["Friedman, E. J.","Henderson, S. G."],"key":"frihen02","id":"frihen02","bibbaseid":"friedman-henderson-sapanefficientschedulingprotocolforwebservers-2002","role":"author","urls":{" paper":"https://people.orie.cornell.edu/shane/pubs/sap.pdf"},"metadata":{"authorlinks":{"henderson, s":"https://people.orie.cornell.edu/shane/"}},"downloads":0},"search_terms":["sap","efficient","scheduling","protocol","web","servers","friedman","henderson"],"keywords":[],"authorIDs":["Rzrm76FFjE8xtscXR"],"dataSources":["ZCuKDjctePZJeeaBw","SEqonpKnx4miWre2P"]}