{"id":"https://openalex.org/W2126119137","doi":"https://doi.org/10.1145/1583991.1583996","title":"The bell is ringing in speed-scaled multiprocessor scheduling","display_name":"The bell is ringing in speed-scaled multiprocessor scheduling","publication_year":2009,"publication_date":"2009-08-11","ids":{"openalex":"https://openalex.org/W2126119137","doi":"https://doi.org/10.1145/1583991.1583996","mag":"2126119137"},"language":"en","primary_location":{"id":"doi:10.1145/1583991.1583996","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1583991.1583996","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-first annual 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/A5066827418","display_name":"Gero Greiner","orcid":null},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Gero Greiner","raw_affiliation_strings":["Technische Universit\u00e4t M\u00fcnchen, Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t M\u00fcnchen, Munich, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084121765","display_name":"Tim Nonner","orcid":"https://orcid.org/0000-0001-7638-5689"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tim Nonner","raw_affiliation_strings":["Albert-Ludwigs-Universit\u00e4t Freiburg, Freiburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Albert-Ludwigs-Universit\u00e4t Freiburg, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028307014","display_name":"Alexander Souza","orcid":null},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alexander Souza","raw_affiliation_strings":["Albert-Ludwigs-Universit\u00e4t Freiburg, Freiburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Albert-Ludwigs-Universit\u00e4t Freiburg, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.8948,"has_fulltext":false,"cited_by_count":71,"citation_normalized_percentile":{"value":0.97113498,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"11","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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.9991000294685364,"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.9933000206947327,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.989300012588501,"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/computer-science","display_name":"Computer science","score":0.7516666650772095},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6794359087944031},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.641764223575592},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6238724589347839},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6009759902954102},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.5174027681350708},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5074140429496765},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4880625009536743},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.46563923358917236},{"id":"https://openalex.org/keywords/ringing","display_name":"Ringing","score":0.4111824631690979},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3397424817085266},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3383922278881073},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.31760668754577637},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3105406165122986},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20024502277374268},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.1823190152645111},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.17774367332458496}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7516666650772095},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6794359087944031},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.641764223575592},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6238724589347839},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6009759902954102},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.5174027681350708},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5074140429496765},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4880625009536743},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.46563923358917236},{"id":"https://openalex.org/C30684385","wikidata":"https://www.wikidata.org/wiki/Q176509","display_name":"Ringing","level":3,"score":0.4111824631690979},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3397424817085266},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3383922278881073},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.31760668754577637},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3105406165122986},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20024502277374268},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.1823190152645111},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.17774367332458496},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1583991.1583996","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1583991.1583996","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.8600000143051147,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1563048602","https://openalex.org/W1569752386","https://openalex.org/W1925374724","https://openalex.org/W1963656977","https://openalex.org/W1985474394","https://openalex.org/W2005012890","https://openalex.org/W2025326263","https://openalex.org/W2034919323","https://openalex.org/W2048730512","https://openalex.org/W2068548282","https://openalex.org/W2099961254","https://openalex.org/W2114993819","https://openalex.org/W2129747980","https://openalex.org/W2130788608","https://openalex.org/W2131218499","https://openalex.org/W2138779116","https://openalex.org/W2152025418","https://openalex.org/W2152575945","https://openalex.org/W2163035318","https://openalex.org/W2170045213","https://openalex.org/W2294460538","https://openalex.org/W2320778555","https://openalex.org/W3121437753","https://openalex.org/W4285719527"],"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/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2109659895","https://openalex.org/W1930615501"],"abstract_inverted_index":{"This":[0,54],"paper":[1],"investigates":[2],"the":[3,39,56,75,96,102,169,196],"problem":[4],"of":[5,61,69,104,106,109,207],"scheduling":[6],"jobs":[7],"on":[8,195],"multiple":[9,91,130,140,150,179],"speed-scaled":[10],"processors":[11,141,151,180],"without":[12,152,181],"migration,":[13],"i.e.,":[14],"we":[15,73,113,133,167,200],"have":[16],"constant":[17,171],"\u03b1":[18],">":[19],"1":[20],"such":[21],"that":[22,51,100,115,135,199],"running":[23],"a":[24,46,82,86,107,121,125,145,205],"processor":[25,84,123],"at":[26],"speed":[27],"s":[28],"results":[29],"in":[30,209],"energy":[31],"consumption":[32],"s#945;":[33],"per":[34],"time":[35],"unit.":[36],"We":[37],"consider":[38],"general":[40],"case":[41],"where":[42,93],"each":[43],"job":[44,189],"has":[45],"monotonously":[47],"increasing":[48],"cost":[49,71],"function":[50],"penalizes":[52],"delay.":[53],"includes":[55],"so":[57],"far":[58],"considered":[59],"cases":[60],"deadlines":[62],"and":[63,160,174,188],"flow":[64],"time.":[65],"For":[66,165],"any":[67,116,136],"type":[68],"delay":[70],"functions,":[72],"obtain":[74,168],"following":[76],"results:":[77],"Any":[78],"\u03b2-approximation":[79,137],"algorithm":[80,89,119,128,138,148,177],"for":[81,90,120,129,139,149,178,183],"single":[83,122],"yields":[85,124,144],"randomized":[87],"\u03b2B\u03b1-approximation":[88,147],"processors,":[92],"B\u03b1":[94,208],"is":[95],"\u03b1th":[97],"Bell":[98],"number,":[99],"is,":[101],"number":[103],"partitions":[105],"set":[108],"size":[110],"\u03b1.":[111],"Analogously,":[112],"show":[114,134],"\u03b2-competitive":[117],"online":[118,127,173],"\u03b2B\u03b1-competitive":[126],"processors.":[131],"Finally,":[132],"with":[142,204],"migration":[143,182,203],"deterministic":[146],"migration.":[153],"These":[154],"facts":[155],"improve":[156],"several":[157],"approximation":[158,176],"ratios":[159],"lead":[161],"to":[162],"new":[163],"results.":[164],"instance,":[166],"first":[170],"factor":[172],"offline":[175],"arbitrary":[184],"release":[185],"times,":[186],"deadlines,":[187],"sizes.":[190],"All":[191],"algorithms":[192],"are":[193],"based":[194],"surprising":[197],"fact":[198],"can":[201],"remove":[202],"blowup":[206],"expectation.":[210]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":22},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":8}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}