{"id":"https://openalex.org/W2176348641","doi":"https://doi.org/10.1145/2809872","title":"Profitable Scheduling on Multiple Speed-Scalable Processors","display_name":"Profitable Scheduling on Multiple Speed-Scalable Processors","publication_year":2015,"publication_date":"2015-09-08","ids":{"openalex":"https://openalex.org/W2176348641","doi":"https://doi.org/10.1145/2809872","mag":"2176348641"},"language":"en","primary_location":{"id":"doi:10.1145/2809872","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2809872","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-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/A5007675663","display_name":"Peter Kling","orcid":"https://orcid.org/0000-0003-0000-8689"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]},{"id":"https://openalex.org/I4210152224","display_name":"Heinz Nixdorf Stiftung","ror":"https://ror.org/04j2tkk21","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I4210152224"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Peter Kling","raw_affiliation_strings":["University of Paderborn, Heinz Nixdorf Institute"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Paderborn, Heinz Nixdorf Institute","institution_ids":["https://openalex.org/I206945453","https://openalex.org/I4210152224"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008580571","display_name":"Peter Pietrzyk","orcid":null},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Peter Pietrzyk","raw_affiliation_strings":["University of Paderborn, Heinz Nixdorf Institute, Paderborn, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Paderborn, Heinz Nixdorf Institute, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.08817997,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"2","issue":"3","first_page":"1","last_page":"19"},"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.9944999814033508,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9898999929428101,"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.7832580208778381},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.6637734174728394},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6226617097854614},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6081907749176025},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.573456346988678},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.4859267771244049},{"id":"https://openalex.org/keywords/energy-consumption","display_name":"Energy consumption","score":0.48205575346946716},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4754902124404907},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4333186149597168},{"id":"https://openalex.org/keywords/power-consumption","display_name":"Power consumption","score":0.4213762879371643},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.41514405608177185},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4119286835193634},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.39294907450675964},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.376467764377594},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.23621588945388794},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23216763138771057},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.23132821917533875},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2275906801223755},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.16813156008720398},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.09574595093727112}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7832580208778381},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.6637734174728394},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6226617097854614},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6081907749176025},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.573456346988678},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.4859267771244049},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.48205575346946716},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4754902124404907},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4333186149597168},{"id":"https://openalex.org/C2984118289","wikidata":"https://www.wikidata.org/wiki/Q29954","display_name":"Power consumption","level":3,"score":0.4213762879371643},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.41514405608177185},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4119286835193634},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.39294907450675964},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.376467764377594},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.23621588945388794},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23216763138771057},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.23132821917533875},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2275906801223755},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.16813156008720398},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09574595093727112},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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/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/2809872","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2809872","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.8100000023841858,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1519739914","https://openalex.org/W1544574065","https://openalex.org/W1568902948","https://openalex.org/W1925374724","https://openalex.org/W2049060423","https://openalex.org/W2099961254","https://openalex.org/W2131218499","https://openalex.org/W2134807578","https://openalex.org/W2138779116","https://openalex.org/W2142339200","https://openalex.org/W2144402549","https://openalex.org/W2148455743","https://openalex.org/W2152981617","https://openalex.org/W2161884835","https://openalex.org/W2296319761","https://openalex.org/W4206478994","https://openalex.org/W4245892509"],"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":{"We":[0,232],"present":[1],"a":[2,15,36,90,96,105,115,123,138,216],"new":[3],"online":[4,190,222,235],"algorithm":[5,223,236],"for":[6,62,212,237],"profit-oriented":[7],"scheduling":[8,67],"on":[9],"multiple":[10,241],"speed-scalable":[11,38],"processors":[12,146,242],"and":[13,25,58,73,81,131,149],"provide":[14,233],"tight":[16,59],"analysis":[17],"of":[18,118,122,128,192,215,240,248],"the":[19,99,111,126,140,177,189,193,195,213,238],"algorithm\u2019s":[20],"competitiveness.":[21],"Our":[22],"results":[23],"generalize":[24],"improve":[26],"upon":[27],"work":[28],"by":[29,207],"Chan":[30,208],"et":[31,209],"al.":[32,210],"[2010],":[33],"which":[34,145],"considers":[35],"single":[37,217],"processor.":[39,218],"Using":[40],"significantly":[41],"different":[42,78],"techniques,":[43],"we":[44,187],"can":[45],"not":[46,87],"only":[47],"extend":[48],"their":[49,151],"model":[50],"to":[51,88,94,103,136,143,147],"multiprocessors":[52],"but":[53,92],"also":[54],"prove":[55],"an":[56,221,234,244],"enhanced":[57],"competitive":[60,246],"ratio":[61,247],"our":[63,66],"algorithm.":[64],"In":[65,134],"problem,":[68,194],"jobs":[69],"arrive":[70],"over":[71,166],"time":[72],"are":[74],"preemptable.":[75],"They":[76,219],"have":[77],"workloads,":[79],"values,":[80],"deadlines.":[82],"The":[83,120],"scheduler":[84,112,141,196],"may":[85],"decide":[86],"finish":[89,137],"job":[91],"instead":[93],"suffer":[95],"loss":[97],"equaling":[98],"job\u2019s":[100,106],"value.":[101],"However,":[102],"process":[104],"workload":[107],"until":[108],"its":[109],"deadline":[110],"must":[113],"invest":[114],"certain":[116],"amount":[117],"energy.":[119,133],"cost":[121],"schedule":[124],"is":[125,158,176,225],"sum":[127],"lost":[129],"values":[130],"invested":[132],"order":[135],"job,":[139],"has":[142,197],"determine":[144],"use":[148],"set":[150],"speeds":[152],"accordingly.":[153],"A":[154],"processor\u2019s":[155],"energy":[156],"consumption":[157,179],"power":[159,178],"P":[160,169],"\u03b1":[161,170,175,226,227,249,250],"(":[162,171],"s":[163,172,174,184],")":[164],"integrated":[165],"time,":[167],"where":[168],")=":[173],"when":[180],"running":[181],"at":[182],"speed":[183],".":[185,251],"Since":[186],"consider":[188],"variant":[191],"no":[198],"knowledge":[199],"about":[200],"future":[201],"jobs.":[202],"This":[203],"problem":[204],"was":[205],"introduced":[206],"[2010]":[211],"case":[214,239],"presented":[220],"that":[224],"+":[228],"2":[229],"e":[230],"\u03b1-competitive.":[231],"with":[243],"improved":[245]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}