{"id":"https://openalex.org/W2025326263","doi":"https://doi.org/10.1145/1148109.1148140","title":"Power-aware scheduling for makespan and flow","display_name":"Power-aware scheduling for makespan and flow","publication_year":2006,"publication_date":"2006-07-30","ids":{"openalex":"https://openalex.org/W2025326263","doi":"https://doi.org/10.1145/1148109.1148140","mag":"2025326263"},"language":"en","primary_location":{"id":"doi:10.1145/1148109.1148140","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148140","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","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/A5108523409","display_name":"David P. Bunde","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"David P. Bunde","raw_affiliation_strings":["Univ. Illinois at Urbana-Champaign, Urbana, IL"],"affiliations":[{"raw_affiliation_string":"Univ. Illinois at Urbana-Champaign, Urbana, IL","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5108523409"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":26.6498,"has_fulltext":false,"cited_by_count":114,"citation_normalized_percentile":{"value":0.99746905,"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":"190","last_page":"196"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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.9995999932289124,"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.9976000189781189,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/uniprocessor-system","display_name":"Uniprocessor system","score":0.9038130044937134},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.838555097579956},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7057430148124695},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7051346302032471},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5447169542312622},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5427626967430115},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5095598697662354},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.4915696084499359},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4783753454685211},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.44651663303375244},{"id":"https://openalex.org/keywords/dynamic-voltage-scaling","display_name":"Dynamic voltage scaling","score":0.44135016202926636},{"id":"https://openalex.org/keywords/energy-consumption","display_name":"Energy consumption","score":0.28768301010131836},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17707622051239014},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.11855638027191162},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.09348246455192566},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07871481776237488},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06658467650413513}],"concepts":[{"id":"https://openalex.org/C79189994","wikidata":"https://www.wikidata.org/wiki/Q3488021","display_name":"Uniprocessor system","level":3,"score":0.9038130044937134},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.838555097579956},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7057430148124695},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7051346302032471},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5447169542312622},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5427626967430115},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5095598697662354},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.4915696084499359},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4783753454685211},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.44651663303375244},{"id":"https://openalex.org/C2776047111","wikidata":"https://www.wikidata.org/wiki/Q632037","display_name":"Dynamic voltage scaling","level":3,"score":0.44135016202926636},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.28768301010131836},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17707622051239014},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.11855638027191162},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.09348246455192566},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07871481776237488},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06658467650413513},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1148109.1148140","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148140","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8799999952316284,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W39337161","https://openalex.org/W1517415100","https://openalex.org/W1532943894","https://openalex.org/W1570584007","https://openalex.org/W1594563152","https://openalex.org/W1604385327","https://openalex.org/W1975784696","https://openalex.org/W1985474394","https://openalex.org/W2001016215","https://openalex.org/W2005012890","https://openalex.org/W2011039300","https://openalex.org/W2012989825","https://openalex.org/W2015790145","https://openalex.org/W2034919323","https://openalex.org/W2047395943","https://openalex.org/W2060591840","https://openalex.org/W2071857538","https://openalex.org/W2085836112","https://openalex.org/W2095644119","https://openalex.org/W2097541335","https://openalex.org/W2099961254","https://openalex.org/W2107314057","https://openalex.org/W2113700934","https://openalex.org/W2129747980","https://openalex.org/W2131218499","https://openalex.org/W2149456682","https://openalex.org/W2149743155","https://openalex.org/W2152575945","https://openalex.org/W2154596969","https://openalex.org/W2155670180","https://openalex.org/W2158521177","https://openalex.org/W2180738807","https://openalex.org/W2607875432","https://openalex.org/W2965712691","https://openalex.org/W4249962740","https://openalex.org/W4285719527","https://openalex.org/W6650619444","https://openalex.org/W6682488519"],"related_works":["https://openalex.org/W4245323253","https://openalex.org/W2136203530","https://openalex.org/W2186708011","https://openalex.org/W2155484663","https://openalex.org/W2155066400","https://openalex.org/W2119059350","https://openalex.org/W1578489595","https://openalex.org/W2172075652","https://openalex.org/W2888222534","https://openalex.org/W61665323"],"abstract_inverted_index":{"We":[0,52,109],"consider":[1],"offline":[2],"scheduling":[3,20,103,125],"algorithms":[4,27],"that":[5,55,73],"incorporate":[6],"speed":[7],"scaling":[8],"to":[9,28,78,119],"address":[10],"the":[11,34,40,47,56,74,93],"bicriteria":[12],"problem":[13,37,42,58],"of":[14,50,67,95],"minimizing":[15],"energy":[16,81],"consumption":[17],"and":[18,38,92],"a":[19,79,88,107,129],"metric.":[21],"For":[22],"makespan,":[23],"we":[24,71],"give":[25,120],"linear-time":[26],"compute":[29],"all":[30],"non-dominated":[31],"solutions":[32],"for":[33,39,124],"general":[35],"uniprocessor":[36],"multiprocessor":[41,57],"when":[43,61,102],"every":[44],"job":[45],"requires":[46],"same":[48],"amount":[49],"work.":[51],"also":[53],"show":[54,72],"becomes":[59],"NP-hard":[60],"jobs":[62,105,127],"can":[63],"require":[64],"different":[65],"amounts":[66],"work.For":[68],"total":[69],"flow,":[70],"optimal":[75],"flow":[76],"corresponding":[77],"particular":[80],"budget":[82],"cannot":[83],"be":[84],"exactly":[85],"computed":[86],"on":[87,106,128],"machine":[89],"supporting":[90],"arithmetic":[91],"extraction":[94],"roots.":[96],"This":[97],"hardness":[98],"result":[99],"holds":[100],"even":[101],"equal-work":[104,126],"uniprocessor.":[108],"do,":[110],"however,":[111],"extend":[112],"previous":[113],"work":[114],"by":[115],"Pruhs":[116],"et":[117],"al.":[118],"an":[121],"arbitrarilygood":[122],"approximation":[123],"multiprocessor.":[130]},"counts_by_year":[{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":10}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}