{"id":"https://openalex.org/W3108253235","doi":"https://doi.org/10.1145/3427764.3428323","title":"Towards checkpoint placement for dynamic memory allocation in intermittent computing","display_name":"Towards checkpoint placement for dynamic memory allocation in intermittent computing","publication_year":2020,"publication_date":"2020-11-15","ids":{"openalex":"https://openalex.org/W3108253235","doi":"https://doi.org/10.1145/3427764.3428323","mag":"3108253235"},"language":"en","primary_location":{"id":"doi:10.1145/3427764.3428323","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3427764.3428323","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th ACM SIGPLAN International Workshop on Tools for Automatic Program Analysis","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/A5054950346","display_name":"Nicholas Shoemaker","orcid":"https://orcid.org/0000-0002-4983-2348"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Nicholas Shoemaker","raw_affiliation_strings":["Branford High School, USA"],"affiliations":[{"raw_affiliation_string":"Branford High School, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045794652","display_name":"Ru\u017eica Piska\u010d","orcid":"https://orcid.org/0000-0002-3267-0776"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ruzica Piskac","raw_affiliation_strings":["Yale University, USA"],"affiliations":[{"raw_affiliation_string":"Yale University, USA","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031902968","display_name":"Mark Santolucito","orcid":"https://orcid.org/0000-0001-8646-4364"},"institutions":[{"id":"https://openalex.org/I98540497","display_name":"Barnard College","ror":"https://ror.org/04rt94r53","country_code":"US","type":"education","lineage":["https://openalex.org/I98540497"]},{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mark Santolucito","raw_affiliation_strings":["Barnard College, USA / Columbia University, USA"],"affiliations":[{"raw_affiliation_string":"Barnard College, USA / Columbia University, USA","institution_ids":["https://openalex.org/I98540497","https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054950346"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.231,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.5079849,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"20","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9995999932289124,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7713682651519775},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5837665796279907},{"id":"https://openalex.org/keywords/c-dynamic-memory-allocation","display_name":"C dynamic memory allocation","score":0.45123204588890076},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.42845970392227173},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.41143277287483215},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.19625288248062134},{"id":"https://openalex.org/keywords/semiconductor-memory","display_name":"Semiconductor memory","score":0.17824587225914001}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7713682651519775},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5837665796279907},{"id":"https://openalex.org/C34339311","wikidata":"https://www.wikidata.org/wiki/Q1050390","display_name":"C dynamic memory allocation","level":4,"score":0.45123204588890076},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.42845970392227173},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.41143277287483215},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.19625288248062134},{"id":"https://openalex.org/C98986596","wikidata":"https://www.wikidata.org/wiki/Q1143031","display_name":"Semiconductor memory","level":2,"score":0.17824587225914001}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3427764.3428323","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3427764.3428323","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th ACM SIGPLAN International Workshop on Tools for Automatic Program Analysis","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.8999999761581421}],"awards":[{"id":"https://openalex.org/G1051160749","display_name":null,"funder_award_id":"1553168,1715387","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W2115721786","https://openalex.org/W2123137040","https://openalex.org/W2137628566","https://openalex.org/W2164298032","https://openalex.org/W2761242776","https://openalex.org/W2897810618","https://openalex.org/W2899106940","https://openalex.org/W2969687601","https://openalex.org/W3004857775","https://openalex.org/W3004993287","https://openalex.org/W3012002440","https://openalex.org/W3110473279"],"related_works":["https://openalex.org/W2167102554","https://openalex.org/W45732507","https://openalex.org/W2512099864","https://openalex.org/W2122491468","https://openalex.org/W2146707680","https://openalex.org/W2270772303","https://openalex.org/W3103495159","https://openalex.org/W3022541129","https://openalex.org/W2401488962","https://openalex.org/W2097849646"],"abstract_inverted_index":{"Energy":[0],"harvesting":[1],"allows":[2],"computational":[3],"devices":[4,17],"to":[5,46],"run":[6],"without":[7],"a":[8,32,68],"battery,":[9],"opening":[10],"new":[11],"application":[12],"domains":[13],"of":[14,74,83],"computing.":[15],"Such":[16],"work":[18,43],"under":[19],"an":[20,84],"intermittent":[21,37,61],"computing":[22,38,62],"model,":[23],"where":[24],"the":[25,60,72],"system":[26],"may":[27],"power":[28],"cycle":[29],"several":[30],"times":[31],"second.":[33],"To":[34],"ensure":[35],"progress,":[36],"uses":[39],"checkpoints,":[40],"with":[41],"much":[42],"being":[44],"dedicated":[45],"this":[47,66,77],"direction.":[48],"However,":[49],"no":[50],"existing":[51],"approaches":[52],"handle":[53],"programs":[54],"using":[55],"dynamically":[56],"allocated":[57],"memory":[58],"in":[59,76],"model.":[63],"We":[64],"pose":[65],"as":[67],"challenge":[69],"area,":[70],"demonstrate":[71],"complexities":[73],"checkpointing":[75],"space,":[78],"and":[79],"propose":[80],"key":[81],"characteristics":[82],"effective":[85],"solution.":[86]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}