{"id":"https://openalex.org/W2553263215","doi":"https://doi.org/10.1109/allerton.2012.6483429","title":"Performance analysis of work-conserving schedulers for minimizing total flow-time with phase precedence","display_name":"Performance analysis of work-conserving schedulers for minimizing total flow-time with phase precedence","publication_year":2012,"publication_date":"2012-10-01","ids":{"openalex":"https://openalex.org/W2553263215","doi":"https://doi.org/10.1109/allerton.2012.6483429","mag":"2553263215"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2012.6483429","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2012.6483429","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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/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"]}]},{"author_position":"last","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"]}]}],"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":1.3859,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.86393011,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1721","last_page":"1728"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9983000159263611,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9979000091552734,"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.7025341987609863},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6237247586250305},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5721441507339478},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.567331075668335},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.5114713907241821},{"id":"https://openalex.org/keywords/homogeneous","display_name":"Homogeneous","score":0.46401914954185486},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4608248472213745},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4482812285423279},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.43433547019958496},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4289165437221527},{"id":"https://openalex.org/keywords/performance-metric","display_name":"Performance metric","score":0.41199153661727905},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3362748622894287},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23977863788604736},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.20831620693206787},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14659205079078674},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.09525230526924133}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7025341987609863},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6237247586250305},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5721441507339478},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.567331075668335},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.5114713907241821},{"id":"https://openalex.org/C66882249","wikidata":"https://www.wikidata.org/wiki/Q169336","display_name":"Homogeneous","level":2,"score":0.46401914954185486},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4608248472213745},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4482812285423279},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.43433547019958496},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4289165437221527},{"id":"https://openalex.org/C2780898871","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Performance metric","level":2,"score":0.41199153661727905},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3362748622894287},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23977863788604736},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.20831620693206787},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14659205079078674},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09525230526924133},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/allerton.2012.6483429","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2012.6483429","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.299.2485","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.299.2485","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/allerton12.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5400000214576721}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W634878933","https://openalex.org/W653041767","https://openalex.org/W1501066815","https://openalex.org/W2003858189","https://openalex.org/W2020694540","https://openalex.org/W2025235423","https://openalex.org/W2048898205","https://openalex.org/W2058225986","https://openalex.org/W2150207209","https://openalex.org/W2173213060","https://openalex.org/W4229644324","https://openalex.org/W6651411529"],"related_works":["https://openalex.org/W4390751688","https://openalex.org/W1967209836","https://openalex.org/W2165839536","https://openalex.org/W3135770504","https://openalex.org/W1980077610","https://openalex.org/W1966397500","https://openalex.org/W3003614595","https://openalex.org/W2357033983","https://openalex.org/W1576430908","https://openalex.org/W1549016268"],"abstract_inverted_index":{"We":[0,109,187],"consider":[1],"the":[2,6,20,42,62,99,107,121,129,147,170],"problem":[3,172],"of":[4,9,15,118],"minimizing":[5],"total":[7],"flow-time":[8,122,131,171],"multiple":[10,16],"jobs":[11,21,50],"in":[12,38,181],"a":[13,35,79,91,112,162,177],"pool":[14],"homogeneous":[17],"machines,":[18],"where":[19,49],"arrive":[22],"over":[23,133],"time":[24,148],"and":[25,57,184],"have":[26,176],"to":[27,52,142,154,191],"be":[28,53],"served":[29],"with":[30,173],"phase":[31,174],"precedence.":[32],"This":[33],"is":[34,87,137],"common":[36],"occurrence":[37],"job":[39,151],"scheduling":[40],"for":[41,169],"increasingly":[43],"popular":[44],"data":[45],"center":[46],"oriented":[47],"systems,":[48],"need":[51],"processed":[54],"through":[55],"Map":[56],"Reduce":[58],"procedures":[59],"before":[60],"leaving":[61],"system.":[63],"For":[64],"this":[65],"problem,":[66],"one":[67],"can":[68,77,103],"construct":[69],"an":[70,115],"arrival":[71],"pattern":[72],"such":[73],"that":[74,88,111,125,165],"no":[75],"scheduler":[76,113,126],"achieve":[78],"constant":[80,178],"competitive":[81],"ratio.":[82],"However,":[83],"what":[84],"we":[85,97,102,160],"find":[86],"by":[89,124,128],"using":[90],"slightly":[92],"weaker":[93],"performance":[94],"metric,":[95],"which":[96],"call":[98],"efficiency":[100,116,179],"ratio,":[101],"provide":[104,188],"bounds":[105],"on":[106],"performance.":[108],"say":[110],"achieves":[114],"ratio":[117,180],"\u03b3":[119,143],"when":[120,146],"incurred":[123],"divided":[127],"minimum":[130],"achieved":[132],"all":[134,166],"possible":[135],"schedulers":[136,168],"less":[138],"than":[139],"or":[140,150],"equal":[141],"almost":[144],"surely,":[145],"slots":[149],"arrivals":[152],"go":[153],"infinity.":[155],"Under":[156],"some":[157],"weak":[158],"assumptions,":[159],"show":[161],"surprising":[163],"property":[164],"work-conserving":[167],"precedence":[175],"both":[182],"preemptive":[183],"non-preemptive":[185],"scenarios.":[186],"numerical":[189],"results":[190],"support":[192],"our":[193],"analysis.":[194]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}