{"id":"https://openalex.org/W2474043386","doi":"https://doi.org/10.1145/2935764.2935773","title":"Fair Online Scheduling for Selfish Jobs on Heterogeneous Machines","display_name":"Fair Online Scheduling for Selfish Jobs on Heterogeneous Machines","publication_year":2016,"publication_date":"2016-07-08","ids":{"openalex":"https://openalex.org/W2474043386","doi":"https://doi.org/10.1145/2935764.2935773","mag":"2474043386"},"language":"en","primary_location":{"id":"doi:10.1145/2935764.2935773","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2935764.2935773","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2935773&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=2935773&type=pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006392819","display_name":"Sungjin Im","orcid":"https://orcid.org/0000-0001-5994-7280"},"institutions":[{"id":"https://openalex.org/I156087764","display_name":"University of California, Merced","ror":"https://ror.org/00d9ah105","country_code":"US","type":"education","lineage":["https://openalex.org/I156087764"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sungjin Im","raw_affiliation_strings":["University of California,, Merced, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California,, Merced, CA, USA","institution_ids":["https://openalex.org/I156087764"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043137436","display_name":"Janardhan Kulkarni","orcid":"https://orcid.org/0009-0005-9980-7836"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Janardhan Kulkarni","raw_affiliation_strings":["Microsoft research, redmond, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft research, redmond, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006392819"],"corresponding_institution_ids":["https://openalex.org/I156087764"],"apc_list":null,"apc_paid":null,"fwci":0.5906,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.72394867,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"185","last_page":"194"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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":0.9998999834060669,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9986000061035156,"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"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9958999752998352,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8194106817245483},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.703004777431488},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6671395897865295},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5647587180137634},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5156077742576599},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5056037902832031},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.5025169849395752},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4760860502719879},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.4682057499885559},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4598901867866516},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.44732990860939026},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4472021162509918},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.4198934733867645},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.3836958706378937},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.25822877883911133},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.14677906036376953},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.11470770835876465}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8194106817245483},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.703004777431488},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6671395897865295},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5647587180137634},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5156077742576599},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5056037902832031},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5025169849395752},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4760860502719879},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.4682057499885559},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4598901867866516},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.44732990860939026},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4472021162509918},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.4198934733867645},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.3836958706378937},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25822877883911133},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.14677906036376953},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.11470770835876465},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2935764.2935773","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2935764.2935773","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2935773&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/2935764.2935773","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2935764.2935773","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2935773&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.46000000834465027}],"awards":[{"id":"https://openalex.org/G3257478624","display_name":"CCF:AF:EAGER Algorithmic Paradigms for Computation on MapReduce","funder_award_id":"1348696","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5774808026","display_name":null,"funder_award_id":"IIS-1447554","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6468044321","display_name":null,"funder_award_id":"CCF-1008065, CCF-1409130, CCF-1408784","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G6559128579","display_name":null,"funder_award_id":"CCF-1348696","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G691689332","display_name":null,"funder_award_id":"CCF-1409130","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7219055393","display_name":null,"funder_award_id":"1409130","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7494066774","display_name":"AF: Medium: Collaborative Research: Multi-dimensional Scheduling and Resource Allocation in Data Centers","funder_award_id":"1408784","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7544743625","display_name":null,"funder_award_id":"CCF-1408784, IIS- 1447554, and CCF-1348696","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7679193398","display_name":null,"funder_award_id":"CCF-1408784","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8302925103","display_name":"BIGDATA: F: DKA: Collaborative Research: Dealing Efficiently with Big Social Network Data","funder_award_id":"1447554","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8699457320","display_name":"AF: Small:  Auction Design in Constrained Settings","funder_award_id":"1008065","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320333031","display_name":"University of California Merced","ror":"https://ror.org/00d9ah105"},{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2474043386.pdf","grobid_xml":"https://content.openalex.org/works/W2474043386.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W165387623","https://openalex.org/W195867136","https://openalex.org/W435588996","https://openalex.org/W1480825842","https://openalex.org/W1526250527","https://openalex.org/W1559482660","https://openalex.org/W1758757893","https://openalex.org/W1964506478","https://openalex.org/W1965378629","https://openalex.org/W1966696868","https://openalex.org/W1972868674","https://openalex.org/W1994553105","https://openalex.org/W1994809241","https://openalex.org/W1998136934","https://openalex.org/W2004165818","https://openalex.org/W2017334559","https://openalex.org/W2018043895","https://openalex.org/W2048730512","https://openalex.org/W2051216594","https://openalex.org/W2065827889","https://openalex.org/W2095721262","https://openalex.org/W2100283019","https://openalex.org/W2101204871","https://openalex.org/W2102252987","https://openalex.org/W2105862720","https://openalex.org/W2109827459","https://openalex.org/W2111714984","https://openalex.org/W2112288559","https://openalex.org/W2120422789","https://openalex.org/W2152025418","https://openalex.org/W2170045213","https://openalex.org/W2272870368","https://openalex.org/W2397558994","https://openalex.org/W2914699946","https://openalex.org/W2997214873"],"related_works":["https://openalex.org/W1545991362","https://openalex.org/W2545511463","https://openalex.org/W3184267879","https://openalex.org/W4390711930","https://openalex.org/W4390711911","https://openalex.org/W4390711934","https://openalex.org/W4390711951","https://openalex.org/W4390722066","https://openalex.org/W2167574351","https://openalex.org/W4390711910"],"abstract_inverted_index":{"Scheduling":[0],"jobs":[1,47,90,115,125],"on":[2,168,210],"multiple":[3,120,153],"machines":[4,49,145],"has":[5,9,23,75],"numerous":[6],"applications":[7],"and":[8],"been":[10,24,76],"a":[11,42,67,92,127,135,163,180,206,237],"central":[12],"topic":[13],"of":[14,33,40,83,110,119,124,134,149,198,216,278,284],"research":[15],"in":[16,27,79,99,116,131,142,236],"the":[17,31,52,55,59,86,108,117,132,143,150,185,189,191,195,199,214,218,226,279],"scheduling":[18,29,70,81,101,112,208,289],"literature.":[19],"Recently,":[20],"much":[21],"progress":[22],"made":[25],"particularly":[26],"online":[28,111],"with":[30,213],"development":[32],"powerful":[34],"analysis":[35],"tools.":[36],"In":[37,103,156],"this":[38,73,104,140,157,271],"line":[39],"wok":[41],"centralized":[43,93,136],"scheduler":[44,94],"typically":[45],"dispatches":[46],"to":[48,50,57,204,262],"exploit":[51],"given":[53,252],"resources":[54],"best":[56,60],"achieve":[58],"system":[61],"performance":[62],"which":[63,233,281],"is":[64,126,203],"measured":[65],"by":[66,172,240],"certain":[68,100],"global":[69],"objective.":[71],"While":[72],"approach":[74],"very":[77],"successful":[78],"attacking":[80],"problems":[82],"growing":[84],"complexity,":[85],"underlying":[87],"assumption":[88],"that":[89,178,187,225],"follow":[91],"may":[95],"not":[96],"be":[97,283],"realistic":[98],"settings.":[102],"paper":[105],"we":[106,176,273],"initiate":[107],"study":[109],"for":[113,287],"selfish":[114],"presence":[118],"machines.":[121],"Selfish":[122],"behavior":[123],"common":[128],"aspect":[129],"observed":[130],"absence":[133],"scheduler.":[137],"We":[138,223,257],"explore":[139],"question":[141],"unrelated":[144],"setting,":[146],"arguably":[147],"one":[148],"most":[151],"general":[152],"machine":[154,186,212],"models.":[155],"model":[158],"each":[159,169,211],"job":[160,181,190],"can":[161],"have":[162],"completely":[164],"different":[165],"processing":[166],"time":[167,197],"machine.":[170],"Motivated":[171],"several":[173,275],"practical":[174],"scenarios,":[175],"assume":[177],"when":[179,251],"arrives":[182],"it":[183],"chooses":[184],"completes":[188],"earliest":[192],"i.e.":[193],"minimizes":[194],"flow":[196,221],"job.":[200],"The":[201],"goal":[202,215],"design":[205],"local":[207],"algorithm":[209,227,280],"minimizing":[217],"total":[219,264],"(weighted)":[220],"time.":[222],"show":[224,270],"Smoothed":[228],"Latest":[229],"Arrival":[230],"Processor":[231],"Sharing,":[232],"was":[234],"introduced":[235],"recent":[238],"work":[239],"Im":[241],"et":[242],"al.":[243],"[27,28],":[244],"yields":[245],"an":[246],"O(1":[247],"/":[248],"\u03b52)-competitive":[249],"schedule":[250],"(1":[253],"+":[254],"\u03b5)":[255],"speed.":[256],"also":[258],"extend":[259],"our":[260],"result":[261,272],"minimize":[263],"flow-time":[265],"plus":[266],"energy":[267],"consumed.":[268],"To":[269],"establish":[274],"interesting":[276],"properties":[277],"could":[282],"potential":[285],"use":[286],"other":[288],"problems.":[290]},"counts_by_year":[{"year":2019,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}