{"id":"https://openalex.org/W4389609031","doi":"https://doi.org/10.1145/3626776","title":"The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load Shifting","display_name":"The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load Shifting","publication_year":2023,"publication_date":"2023-12-07","ids":{"openalex":"https://openalex.org/W4389609031","doi":"https://doi.org/10.1145/3626776"},"language":"en","primary_location":{"id":"doi:10.1145/3626776","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3626776","pdf_url":null,"source":{"id":"https://openalex.org/S4210193547","display_name":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","issn_l":"2476-1249","issn":["2476-1249"],"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":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","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/A5059934044","display_name":"Adam Lechowicz","orcid":"https://orcid.org/0000-0002-7774-9939"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Adam Lechowicz","raw_affiliation_strings":["University of Massachusetts Amherst, Amherst, MA, USA"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts Amherst, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083737813","display_name":"Nicolas Christianson","orcid":"https://orcid.org/0000-0001-8330-8964"},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nicolas Christianson","raw_affiliation_strings":["California Institute of Technology, Pasadena, CA, USA"],"affiliations":[{"raw_affiliation_string":"California Institute of Technology, Pasadena, CA, USA","institution_ids":["https://openalex.org/I122411786"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085050673","display_name":"Jinhang Zuo","orcid":"https://orcid.org/0000-0002-9557-3551"},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]},{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jinhang Zuo","raw_affiliation_strings":["California Institute of Technology &amp; University of Massachusetts Amherst, Pasadena, CA, USA"],"affiliations":[{"raw_affiliation_string":"California Institute of Technology &amp; University of Massachusetts Amherst, Pasadena, CA, USA","institution_ids":["https://openalex.org/I122411786","https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048736480","display_name":"Noman Bashir","orcid":"https://orcid.org/0000-0001-9304-910X"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Noman Bashir","raw_affiliation_strings":["University of Massachusetts Amherst, Amherst, MA, USA"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts Amherst, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046146251","display_name":"Mohammad Hajiesmaili","orcid":"https://orcid.org/0000-0001-9278-2254"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammad Hajiesmaili","raw_affiliation_strings":["University of Massachusetts Amherst, Amherst, MA, USA"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts Amherst, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062565732","display_name":"Adam Wierman","orcid":"https://orcid.org/0000-0002-5923-0199"},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Adam Wierman","raw_affiliation_strings":["California Institute of Technology, Pasadena, CA, USA"],"affiliations":[{"raw_affiliation_string":"California Institute of Technology, Pasadena, CA, USA","institution_ids":["https://openalex.org/I122411786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032939724","display_name":"Prashant Shenoy","orcid":"https://orcid.org/0000-0002-5435-1901"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prashant Shenoy","raw_affiliation_strings":["University of Massachusetts Amherst, Amherst, MA, USA"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts Amherst, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5059934044"],"corresponding_institution_ids":["https://openalex.org/I24603500"],"apc_list":null,"apc_paid":null,"fwci":2.8128,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.91356959,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"7","issue":"3","first_page":"1","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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.9962000250816345,"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/T11182","display_name":"Auction Theory and Applications","score":0.9940999746322632,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6908571720123291},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6687594056129456},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.5844430327415466},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5535863637924194},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4957936704158783},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4591253995895386},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44886505603790283},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43332144618034363},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.41735613346099854},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1520436406135559},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.08227542042732239}],"concepts":[{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6908571720123291},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6687594056129456},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.5844430327415466},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5535863637924194},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4957936704158783},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4591253995895386},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44886505603790283},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43332144618034363},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.41735613346099854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1520436406135559},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.08227542042732239},{"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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3626776","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3626776","pdf_url":null,"source":{"id":"https://openalex.org/S4210193547","display_name":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","issn_l":"2476-1249","issn":["2476-1249"],"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":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1966160207","https://openalex.org/W1998596820","https://openalex.org/W2013896042","https://openalex.org/W2020196954","https://openalex.org/W2049045141","https://openalex.org/W2089591294","https://openalex.org/W2107128713","https://openalex.org/W2114538202","https://openalex.org/W2118877434","https://openalex.org/W2120881346","https://openalex.org/W2123179625","https://openalex.org/W2135980784","https://openalex.org/W2151484814","https://openalex.org/W2344908750","https://openalex.org/W2407643974","https://openalex.org/W2760963892","https://openalex.org/W2942595830","https://openalex.org/W2951973576","https://openalex.org/W3003098876","https://openalex.org/W3025585506","https://openalex.org/W3027199124","https://openalex.org/W3164916608","https://openalex.org/W3205803342","https://openalex.org/W3208379186","https://openalex.org/W4211261209","https://openalex.org/W4224874070","https://openalex.org/W4226049417","https://openalex.org/W4243443865","https://openalex.org/W4283384652","https://openalex.org/W4311079979","https://openalex.org/W4318540568","https://openalex.org/W4318541641","https://openalex.org/W4376651401","https://openalex.org/W4382766241","https://openalex.org/W6704433505"],"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/W4383045365"],"abstract_inverted_index":{"We":[0,163],"introduce":[1],"and":[2,7,46,98,106,157,205],"study":[3],"the":[4,18,39,80,125,138,155,167,175,194],"online":[5,75,128,181],"pause":[6,70],"resume":[8,72],"problem.":[9,162],"In":[10],"this":[11,161],"problem,":[12],"a":[13,25,44,87,108],"player":[14,40,55],"attempts":[15],"to":[16,49,120],"find":[17],"k":[19],"lowest":[20],"(alternatively,":[21],"highest)":[22],"prices":[23],"in":[24,63,124],"sequence":[26],"of":[27,82,94,102,141,160,196],"fixed":[28],"length":[29],"T,":[30],"which":[31],"is":[32,41,77],"revealed":[33],"sequentially.":[34],"At":[35],"each":[36],"time":[37,65],"step,":[38],"presented":[42],"with":[43],"price":[45],"decides":[47],"whether":[48],"accept":[50],"or":[51,71,112],"reject":[52],"it.":[53],"The":[54],"incurs":[56,107],"aswitching":[57],"cost":[58,109],"whenever":[59,68],"their":[60],"decision":[61],"changes":[62],"consecutive":[64],"steps,":[66],"i.e.,":[67],"they":[69],"purchasing.":[73],"This":[74],"problem":[76],"motivated":[78],"by":[79,171,178],"goal":[81],"carbon-aware":[83,197],"load":[84,198],"shifting,":[85],"where":[86],"workload":[88],"may":[89],"be":[90],"paused":[91],"during":[92,100],"periods":[93,101],"high":[95],"carbon":[96,104,202],"intensity":[97,105],"resumed":[99],"low":[103],"when":[110],"saving":[111],"restoring":[113],"its":[114],"state.":[115],"It":[116],"has":[117],"strong":[118],"connections":[119],"existing":[121,142,206],"problems":[122],"studied":[123],"literature":[126],"on":[127,147,193],"optimization,":[129],"though":[130],"it":[131],"introduces":[132],"unique":[133],"technical":[134],"challenges":[135],"that":[136,166],"prevent":[137],"direct":[139],"application":[140,195],"algorithms.":[143,208],"Extending":[144],"prior":[145],"work":[146],"threshold-based":[148],"algorithms,":[149],"we":[150,184],"introducedouble-threshold":[151],"algorithms":[152,173],"for":[153],"both":[154],"minimization":[156],"maximization":[158],"variants":[159],"further":[164],"show":[165],"competitive":[168],"ratios":[169],"achieved":[170],"these":[172],"are":[174],"best":[176],"achievable":[177],"any":[179],"deterministic":[180],"algorithm.":[182],"Finally,":[183],"empirically":[185],"validate":[186],"our":[187],"proposed":[188],"algorithm":[189],"through":[190],"case":[191],"studies":[192],"shifting":[199],"using":[200],"real":[201],"trace":[203],"data":[204],"baseline":[207]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2023-12-13T00:00:00"}
