{"id":"https://openalex.org/W2111326262","doi":"https://doi.org/10.1109/infcom.2013.6566956","title":"A new analytical technique for designing provably efficient MapReduce schedulers","display_name":"A new analytical technique for designing provably efficient MapReduce schedulers","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W2111326262","doi":"https://doi.org/10.1109/infcom.2013.6566956","mag":"2111326262"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2013.6566956","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2013.6566956","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5042697309","display_name":"Yousi Zheng","orcid":null},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yousi Zheng","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Ohio State University, Columbus, OH, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Ohio State University, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035752536","display_name":"Ness B. Shroff","orcid":"https://orcid.org/0000-0002-4606-6879"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ness B. Shroff","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Department of Computer Science and Engineering, Ohio State University, Columbus, OH, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Department of Computer Science and Engineering, Ohio State University, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112813866","display_name":"Prasun Sinha","orcid":null},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prasun Sinha","raw_affiliation_strings":["Department of Computer Science and Engineering, Ohio State University, Columbus, OH, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Ohio State University, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042697309"],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":20.8889,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.99181706,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9995999932289124,"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.9995999932289124,"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/T12288","display_name":"Optimization and Search Problems","score":0.9954000115394592,"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/T10273","display_name":"IoT and Edge/Fog Computing","score":0.993399977684021,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8189989328384399},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7906796932220459},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6637632250785828},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5522211194038391},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.542457103729248},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5291892290115356},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.5199414491653442},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4664454162120819},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4457109570503235},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.413519024848938},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4077718257904053},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30827057361602783},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2009938359260559},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12615355849266052},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.08655759692192078},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07485389709472656}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8189989328384399},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7906796932220459},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6637632250785828},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5522211194038391},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.542457103729248},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5291892290115356},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.5199414491653442},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4664454162120819},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4457109570503235},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.413519024848938},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4077718257904053},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30827057361602783},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2009938359260559},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12615355849266052},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.08655759692192078},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07485389709472656},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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":2,"locations":[{"id":"doi:10.1109/infcom.2013.6566956","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2013.6566956","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.299.3031","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.299.3031","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.ohio-state.edu/~prasun/publications/conf/infocom13_mapreduce.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2003858189","https://openalex.org/W2020694540","https://openalex.org/W2048898205","https://openalex.org/W2096125134","https://openalex.org/W2122465391","https://openalex.org/W2150207209","https://openalex.org/W4229644324","https://openalex.org/W6651411529"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W4390203503","https://openalex.org/W2797898895","https://openalex.org/W2131569046","https://openalex.org/W2045215405"],"abstract_inverted_index":{"With":[0],"the":[1,15,30,34,43,47,65,87,90,94,98,102,117,133,141,170,212],"rapid":[2],"increase":[3],"in":[4,14,42,181],"size":[5],"and":[6,52,60,184,204],"number":[7],"of":[8,32,37,40,93,101,114,130],"jobs":[9,20,41,48],"that":[10,69,137,209],"are":[11,190],"being":[12],"processed":[13,56],"MapReduce":[16,44],"framework,":[17,45],"efficiently":[18],"scheduling":[19],"under":[21],"this":[22,71],"framework":[23],"is":[24,123,149],"becoming":[25],"increasingly":[26],"important.":[27],"We":[28,67,107],"consider":[29],"problem":[31,72],"minimizing":[33],"total":[35],"flowtime":[36],"a":[38,81,110,165,177,198],"sequence":[39],"where":[46],"arrive":[49],"over":[50,145],"time":[51,92,100],"need":[53],"to":[54,97,125,156,192],"be":[55],"through":[57,205],"both":[58,182],"Map":[59],"Reduce":[61],"procedures":[62],"before":[63],"leaving":[64],"system.":[66],"show":[68,164,208],"for":[70,73,169],"non-preemptive":[74],"tasks,":[75],"no":[76],"on-line":[77],"algorithm":[78,96,122],"can":[79],"achieve":[80,126],"constant":[82,178],"competitive":[83],"ratio":[84,88,129,180,202],"(defined":[85],"as":[86],"between":[89],"completion":[91,99],"online":[95,121,195],"optimal":[103],"non-causal":[104],"off-line":[105],"algorithm).":[106],"then":[108,163],"construct":[109],"slightly":[111],"weaker":[112],"metric":[113],"performance":[115],"called":[116],"efficiency":[118,128,179,201],"ratio.":[119],"An":[120],"said":[124],"an":[127,194],"\u03b3":[131],"when":[132],"flow-time":[134,143,171],"incurred":[135],"by":[136,140],"scheduler":[138,175,196],"divided":[139],"minimum":[142],"achieved":[144],"all":[146],"possible":[147],"schedulers":[148],"almost":[150],"surely":[151],"less":[152],"than":[153],"or":[154],"equal":[155],"\u03b3.":[157],"Under":[158],"some":[159],"weak":[160],"assumptions,":[161],"we":[162,189,207],"surprising":[166],"property":[167],"that,":[168],"problem,":[172],"any":[173],"work-conserving":[174],"has":[176],"preemptive":[183],"nonpreemptive":[185],"scenarios.":[186],"More":[187],"importantly,":[188],"able":[191],"develop":[193],"with":[197],"very":[199],"small":[200],"(2),":[203],"simulations":[206],"it":[210],"outperforms":[211],"state-of-the-art":[213],"schedulers.":[214]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":9}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}