{"id":"https://openalex.org/W2025256803","doi":"https://doi.org/10.1145/2612669.2612672","title":"A note on multiprocessor speed scaling with precedence constraints","display_name":"A note on multiprocessor speed scaling with precedence constraints","publication_year":2014,"publication_date":"2014-06-21","ids":{"openalex":"https://openalex.org/W2025256803","doi":"https://doi.org/10.1145/2612669.2612672","mag":"2025256803"},"language":"en","primary_location":{"id":"doi:10.1145/2612669.2612672","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2612669.2612672","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},"type":"preprint","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/A5063171222","display_name":"Evripidis Bampis","orcid":"https://orcid.org/0000-0002-4498-3040"},"institutions":[{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]},{"id":"https://openalex.org/I4210159731","display_name":"LIP6","ror":"https://ror.org/05krcen59","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I39804081","https://openalex.org/I4210159245","https://openalex.org/I4210159731"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Evripidis Bampis","raw_affiliation_strings":["Sorbonne Universit\u00e9s, UPMC Univ. Paris 06, UMR 7606, LIP6, Paris, France"],"affiliations":[{"raw_affiliation_string":"Sorbonne Universit\u00e9s, UPMC Univ. Paris 06, UMR 7606, LIP6, Paris, France","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I39804081","https://openalex.org/I4210159731"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053264815","display_name":"Dimitrios Letsios","orcid":"https://orcid.org/0000-0002-3258-7585"},"institutions":[{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]},{"id":"https://openalex.org/I4210159731","display_name":"LIP6","ror":"https://ror.org/05krcen59","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I39804081","https://openalex.org/I4210159245","https://openalex.org/I4210159731"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Dimitrios Letsios","raw_affiliation_strings":["Sorbonne Universit\u00e9s, UPMC Univ. Paris 06, UMR 7606, LIP6, Paris, France"],"affiliations":[{"raw_affiliation_string":"Sorbonne Universit\u00e9s, UPMC Univ. Paris 06, UMR 7606, LIP6, Paris, France","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I39804081","https://openalex.org/I4210159731"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085905772","display_name":"Giorgio Lucarelli","orcid":"https://orcid.org/0000-0001-7368-355X"},"institutions":[{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]},{"id":"https://openalex.org/I4210159731","display_name":"LIP6","ror":"https://ror.org/05krcen59","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I39804081","https://openalex.org/I4210159245","https://openalex.org/I4210159731"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Giorgio Lucarelli","raw_affiliation_strings":["Sorbonne Universit\u00e9s, UPMC Univ. Paris 06, UMR 7606, LIP6, Paris, France"],"affiliations":[{"raw_affiliation_string":"Sorbonne Universit\u00e9s, UPMC Univ. Paris 06, UMR 7606, LIP6, Paris, France","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I39804081","https://openalex.org/I4210159731"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5063171222"],"corresponding_institution_ids":["https://openalex.org/I204730241","https://openalex.org/I39804081","https://openalex.org/I4210159731"],"apc_list":null,"apc_paid":null,"fwci":1.0857,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.80378511,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"138","last_page":"142"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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.9998000264167786,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9991000294685364,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9983999729156494,"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/computer-science","display_name":"Computer science","score":0.7558853626251221},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.735332727432251},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.719773530960083},{"id":"https://openalex.org/keywords/energy-consumption","display_name":"Energy consumption","score":0.6774773597717285},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6328420639038086},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6058546304702759},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5918126106262207},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.5779743790626526},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.560707688331604},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5171067714691162},{"id":"https://openalex.org/keywords/dynamic-voltage-scaling","display_name":"Dynamic voltage scaling","score":0.49431276321411133},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4723547399044037},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4557771682739258},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4439144432544708},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.43831580877304077},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14548641443252563},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.07818874716758728}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7558853626251221},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.735332727432251},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.719773530960083},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.6774773597717285},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6328420639038086},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6058546304702759},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5918126106262207},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.5779743790626526},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.560707688331604},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5171067714691162},{"id":"https://openalex.org/C2776047111","wikidata":"https://www.wikidata.org/wiki/Q632037","display_name":"Dynamic voltage scaling","level":3,"score":0.49431276321411133},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4723547399044037},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4557771682739258},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4439144432544708},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.43831580877304077},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14548641443252563},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.07818874716758728},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2612669.2612672","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2612669.2612672","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01215576v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01215576","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2014), Jun 2014, Prague, Czech Republic. pp.138-142, ⟨10.1145/2612669.2612672⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.9100000262260437,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320338080","display_name":"European Social Fund","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1978018278","https://openalex.org/W1991124379","https://openalex.org/W2012989825","https://openalex.org/W2014008637","https://openalex.org/W2025326263","https://openalex.org/W2085836112","https://openalex.org/W2089269509","https://openalex.org/W2099961254","https://openalex.org/W2112694890","https://openalex.org/W2152981617","https://openalex.org/W2607875432","https://openalex.org/W6682354035"],"related_works":["https://openalex.org/W2155564881","https://openalex.org/W2062808533","https://openalex.org/W1833217363","https://openalex.org/W1809394610","https://openalex.org/W2101300711","https://openalex.org/W1511880291","https://openalex.org/W2134658009","https://openalex.org/W2153689068","https://openalex.org/W2618418901","https://openalex.org/W2533764636"],"abstract_inverted_index":{"We":[0,99,126],"consider":[1],"the":[2,26,29,32,36,67,72,83,87,90,93,96,105,111,121,124,129,134,152],"problem":[3,112],"of":[4,8,16,28,123],"scheduling":[5,149],"a":[6,14,44,59,101,141],"set":[7,15],"jobs,":[9],"under":[10],"precedence":[11],"constraints,":[12],"on":[13,58],"speed":[17,92,153],"scalable":[18],"parallel":[19],"processors.":[20,125],"The":[21],"goal":[22],"is":[23,89,95,120],"to":[24,65,139,147],"minimize":[25],"makespan":[27],"schedule,":[30],"i.e.":[31],"time":[33],"at":[34],"which":[35,81],"last":[37],"job":[38],"finishes":[39],"its":[40],"execution,":[41],"without":[42],"violating":[43],"given":[45],"energy":[46,68,73,97],"budget.":[47],"This":[48],"situation":[49],"finds":[50,145],"applications":[51,146],"in":[52,76,137,151],"computer":[53],"devices":[54],"whose":[55],"lifetime":[56],"depends":[57],"limited":[60],"battery":[61],"efficiency.":[62],"In":[63],"order":[64,138],"handle":[66],"consumption":[69],"we":[70],"use":[71],"model":[74],"introduced":[75],"[Yao":[77],"et":[78,114],"al.,":[79,115],"FOCS'95],":[80],"captures":[82],"intuitive":[84],"idea":[85,131],"that":[86,144],"higher":[88,94],"processor's":[91],"consumption.":[98],"propose":[100,140],"(2-1/m)-approximation":[102],"algorithm":[103,109],"improving":[104],"best":[106],"known":[107],"poly-log(m)-approximation":[108],"for":[110,133],"[Pruhs":[113],"TOCS":[116],"2008],":[117],"where":[118],"m":[119],"number":[122],"also":[127],"extend":[128],"simple":[130],"used":[132],"above":[135],"problem,":[136],"generalized":[142],"framework":[143],"other":[148],"problems":[150],"scaling":[154],"setting.":[155]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":17},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}