{"id":"https://openalex.org/W1972337144","doi":"https://doi.org/10.1137/090772228","title":"Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service","display_name":"Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1972337144","doi":"https://doi.org/10.1137/090772228","mag":"1972337144"},"language":"en","primary_location":{"id":"doi:10.1137/090772228","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090772228","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/16b95b13-50c3-4537-abce-bb00e73b8dc3","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["nikhil@us.ibm.com#TAB#"],"affiliations":[{"raw_affiliation_string":"nikhil@us.ibm.com#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046525615","display_name":"Kirk Pruhs","orcid":"https://orcid.org/0000-0001-5680-1753"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kirk R. Pruhs","raw_affiliation_strings":["kirk@cs.pitt.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"kirk@cs.pitt.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.2735,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.94242065,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"39","issue":"7","first_page":"3311","last_page":"3335"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.987500011920929,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7158560156822205},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.6342997550964355},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5677292346954346},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5598294734954834},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49989748001098633},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.4358747899532318},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36620187759399414},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2432195246219635},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16528379917144775},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.07100185751914978}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7158560156822205},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.6342997550964355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5677292346954346},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5598294734954834},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49989748001098633},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.4358747899532318},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36620187759399414},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2432195246219635},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16528379917144775},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.07100185751914978},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/090772228","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090772228","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/16b95b13-50c3-4537-abce-bb00e73b8dc3","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/16b95b13-50c3-4537-abce-bb00e73b8dc3","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N & Pruhs, K R 2010, 'Server scheduling to balance priorieties, fairness, and average qualityof service', SIAM Journal on Computing, vol. 39, no. 7, pp. 3311-3335. https://doi.org/10.1137/090772228","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/16b95b13-50c3-4537-abce-bb00e73b8dc3","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/16b95b13-50c3-4537-abce-bb00e73b8dc3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 39(7), 3311 - 3335. Society for Industrial and Applied Mathematics (SIAM)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/16b95b13-50c3-4537-abce-bb00e73b8dc3","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/16b95b13-50c3-4537-abce-bb00e73b8dc3","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N & Pruhs, K R 2010, 'Server scheduling to balance priorieties, fairness, and average qualityof service', SIAM Journal on Computing, vol. 39, no. 7, pp. 3311-3335. https://doi.org/10.1137/090772228","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.4399999976158142,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1487184349","https://openalex.org/W1552828154","https://openalex.org/W1584243868","https://openalex.org/W1606894208","https://openalex.org/W1970286891","https://openalex.org/W1972868674","https://openalex.org/W1986166139","https://openalex.org/W2001016215","https://openalex.org/W2007568515","https://openalex.org/W2053806044","https://openalex.org/W2054322995","https://openalex.org/W2060640049","https://openalex.org/W2071404693","https://openalex.org/W2079538592","https://openalex.org/W2086277678","https://openalex.org/W2086365412","https://openalex.org/W2088632781","https://openalex.org/W2101204871","https://openalex.org/W2104306824","https://openalex.org/W2123219527","https://openalex.org/W2124718325","https://openalex.org/W2133671968","https://openalex.org/W2134553994","https://openalex.org/W2136400145","https://openalex.org/W2142258482","https://openalex.org/W2166867051","https://openalex.org/W2170045213","https://openalex.org/W2574678133","https://openalex.org/W2612150260","https://openalex.org/W2751601659","https://openalex.org/W2912168264","https://openalex.org/W2997214873","https://openalex.org/W3138991387","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2389214306","https://openalex.org/W2965083567","https://openalex.org/W4235240664","https://openalex.org/W1838576100","https://openalex.org/W2757182831","https://openalex.org/W2095886385","https://openalex.org/W2089704382","https://openalex.org/W1983399550"],"abstract_inverted_index":{"Often":[0],"server":[1,49],"systems":[2],"do":[3],"not":[4,211],"implement":[5],"the":[6,42,54,58,76,88,109,120,137,146,154,166,176,193],"best":[7],"known":[8],"algorithms":[9,22,91,181],"for":[10,33,75,92,108,124,136,165,214],"optimizing":[11,93,125],"average":[12,35,94,126],"Quality":[13],"of":[14,18,57,79,112,140,170,205],"Service":[15],"(QoS)":[16],"out":[17],"concern":[19,177],"that":[20,68,87,119,145,175,178,192],"these":[21,179],"may":[23,182],"be":[24],"insufficiently":[25],"fair":[26],"to":[27,40,52],"individual":[28],"jobs.":[29],"The":[30],"standard":[31,59,89,121,180],"method":[32],"balancing":[34],"QoS":[36,60],"and":[37,63,100,114,153],"fairness":[38,208],"is":[39,70,133,186,201,210],"optimize":[41,53],"$\\ell_p$":[43,55,77,110,138,168],"norm,":[44],"$1<p<\\infty$.":[45],"Thus":[46],"we":[47,190],"consider":[48],"scheduling":[50],"strategies":[51],"norms":[56,78,111,139,169],"measures,":[61],"flow":[62,81,113],"stretch.":[64,83,115],"We":[65,84,116,142],"first":[66],"show":[67,86,118,144,191],"there":[69],"no":[71],"$n^{o(1)}$-competitive":[72,213],"online":[73,147],"algorithm":[74,123],"either":[80],"or":[82,196],"then":[85,117,143],"clairvoyant":[90],"QoS,":[95,127],"Shortest":[96,101,128,158],"Job":[97],"First":[98,131,151,161],"(SJF),":[99],"Remaining":[102],"Processing":[103],"Time":[104,130,160],"(SRPT),":[105],"are":[106,163],"scalable":[107,135,164],"nonclairvoyant":[122,155],"Elapsed":[129,159],"(SETF),":[132],"also":[134],"flow.":[141,171],"algorithm,":[148,156,199],"Highest":[149],"Density":[150],"(HDF),":[152],"Weighted":[157],"(WSETF),":[162],"weighted":[167],"These":[172],"results":[173],"suggest":[174],"unnecessarily":[183],"starve":[184],"jobs":[185],"unfounded.":[187],"In":[188],"contrast,":[189],"Round":[194],"Robin,":[195],"Processor":[197],"Sharing,":[198],"which":[200],"sometimes":[202],"adopted":[203],"because":[204],"its":[206],"seeming":[207],"properties,":[209],"$O(1+\\epsilon)$-speed,":[212],"sufficiently":[215],"small":[216],"$\\epsilon$.":[217]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}