{"id":"https://openalex.org/W3046034407","doi":null,"title":"On Max-Min Fairness of Completion Times for Multi-Task Job Scheduling","display_name":"On Max-Min Fairness of Completion Times for Multi-Task Job Scheduling","publication_year":2020,"publication_date":"2020-06-22","ids":{"openalex":"https://openalex.org/W3046034407","mag":"3046034407"},"language":"en","primary_location":{"id":"mag:3046034407","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/networking/networking2020.html#ShafieeG20","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"2020 IFIP Networking Conference (Networking)","raw_type":null},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091747149","display_name":"Mehrnoosh Shafiee","orcid":"https://orcid.org/0000-0002-4558-4746","observed_orcids":["https://orcid.org/0000-0002-4558-4746"]},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mehrnoosh Shafiee","raw_affiliation_strings":["Columbia University,Electrical Engineering Department"],"raw_orcid":"https://orcid.org/0000-0002-4558-4746","affiliations":[{"raw_affiliation_string":"Columbia University,Electrical Engineering Department","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062344673","display_name":"Javad Ghaderi","orcid":"https://orcid.org/0000-0001-8038-550X","observed_orcids":["https://orcid.org/0000-0001-8038-550X"]},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Javad Ghaderi","raw_affiliation_strings":["Columbia University,Electrical Engineering Department"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Columbia University,Electrical Engineering Department","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I78577930"],"apc_list":null,"apc_paid":null,"fwci":0.6375,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.62885185,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"100","last_page":"108"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.6547999978065491,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.6547999978065491,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.16419999301433563,"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.07460000365972519,"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/max-min-fairness","display_name":"max-min fairness","score":0.9980000257492065},{"id":"https://openalex.org/keywords/completion-time","display_name":"completion time","score":0.8230000138282776},{"id":"https://openalex.org/keywords/parallel-job-scheduling","display_name":"parallel job scheduling","score":0.5540000200271606},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.8339999914169312},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.8259999752044678},{"id":"https://openalex.org/keywords/coflow-scheduling","display_name":"coflow scheduling","score":0.8809999823570251},{"id":"https://openalex.org/keywords/distributed-computing-platform","display_name":"distributed computing platform","score":0.6330000162124634},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.746999979019165}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.642613410949707},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5660508871078491},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5414914488792419},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4766981303691864},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46352773904800415},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43892189860343933},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.4201148748397827},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3350926637649536},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23693028092384338},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21676704287528992},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.07495126128196716},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:3046034407","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/networking/networking2020.html#ShafieeG20","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"2020 IFIP Networking Conference (Networking)","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W169464267","https://openalex.org/W1525444182","https://openalex.org/W1535431348","https://openalex.org/W1890643295","https://openalex.org/W1973065348","https://openalex.org/W1982055457","https://openalex.org/W1985709216","https://openalex.org/W1987354455","https://openalex.org/W2013932952","https://openalex.org/W2031879787","https://openalex.org/W2092252886","https://openalex.org/W2096125134","https://openalex.org/W2100830825","https://openalex.org/W2123878303","https://openalex.org/W2128785983","https://openalex.org/W2129542763","https://openalex.org/W2133569115","https://openalex.org/W2139901185","https://openalex.org/W2162986857","https://openalex.org/W2167444644","https://openalex.org/W2173213060","https://openalex.org/W2189465200","https://openalex.org/W2400042314","https://openalex.org/W2504213755","https://openalex.org/W2515330476","https://openalex.org/W2611804663","https://openalex.org/W2613173048","https://openalex.org/W2615258659","https://openalex.org/W2756859730","https://openalex.org/W2791402393"],"related_works":["https://openalex.org/W1527359530","https://openalex.org/W4248923780","https://openalex.org/W2964254084","https://openalex.org/W7099297831","https://openalex.org/W2791456077","https://openalex.org/W4415766353","https://openalex.org/W2148241653","https://openalex.org/W2055748525","https://openalex.org/W2504213755","https://openalex.org/W3189180802"],"abstract_inverted_index":{"We":[0,12,152,191,212],"study":[1],"the":[2,35,95,104,124,172,177,187,214],"max-min":[3,80,125,139,173,188],"fairness":[4,81,140],"of":[5,20,23,57,97,106,122,128,133,159,169,171,208,216],"multi-task":[6],"jobs":[7],"in":[8,75,89,102,141],"distributed":[9,144],"computing":[10],"platforms.":[11],"consider":[13],"a":[14,21,50,54,76,98,117,166,181,223,228],"setting":[15],"where":[16],"each":[17],"job":[18,36,46,99,109,129],"consists":[19],"set":[22],"parallel":[24],"tasks":[25,42,74],"that":[26,78,137,195],"need":[27],"to":[28,67,72,93,155],"be":[29],"processed":[30],"on":[31,164,180],"different":[32],"servers,":[33],"and":[34,61,176,205],"is":[37,47,53,66,71,136,150],"completed":[38],"once":[39],"all":[40],"its":[41,58],"finish":[43],"processing.":[44],"Each":[45],"associated":[48],"with":[49,110],"utility":[51,96,105],"which":[52,90],"decreasing":[55],"function":[56],"completion":[59],"time,":[60],"captures":[62],"how":[63],"sensitive":[64],"it":[65],"latency.":[68],"The":[69,131],"objective":[70],"schedule":[73,88],"way":[77],"achieves":[79],"for":[82],"jobs\u2019":[83],"utilities,":[84],"i.e.,":[85],"an":[86],"optimal":[87],"any":[91],"attempt":[92],"improve":[94],"necessarily":[100],"results":[101],"hurting":[103],"some":[107],"other":[108,143,178],"smaller":[111],"or":[112],"equal":[113],"utility.We":[114],"first":[115],"show":[116],"strong":[118],"result":[119,135],"regarding":[120],"NP-hardness":[121],"finding":[123,165],"fair":[126,174,189],"vector":[127],"utilities.":[130],"implication":[132],"this":[134],"achieving":[138],"many":[142],"scheduling":[145,193],"problems":[146],"(e.g.,":[147],"coflow":[148],"scheduling)":[149],"NP-hard.":[151],"then":[153],"proceed":[154],"define":[156],"two":[157],"notions":[158],"approximation":[160,200],"solutions:":[161],"one":[162],"based":[163,179],"certain":[167],"number":[168],"elements":[170],"vector,":[175],"single-objective":[182],"optimization":[183],"whose":[184],"solution":[185],"gives":[186],"vector.":[190],"develop":[192],"algorithms":[194,218],"provide":[196],"guarantees":[197],"under":[198],"these":[199],"notions,":[201],"using":[202,222],"dynamic":[203],"programming":[204],"random":[206],"perturbation":[207],"tasks\u2019":[209],"processing":[210],"times.":[211],"verify":[213],"performance":[215],"our":[217],"through":[219],"extensive":[220],"simulations,":[221],"real":[224],"traffic":[225],"trace":[226],"from":[227],"large":[229],"Google":[230],"cluster.":[231]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2020-08-03T00:00:00"}