{"id":"https://openalex.org/W4378982095","doi":"https://doi.org/10.1145/3603172","title":"Optimal Checkpointing Strategy for Real-time Systems with Both Logical and Timing Correctness","display_name":"Optimal Checkpointing Strategy for Real-time Systems with Both Logical and Timing Correctness","publication_year":2023,"publication_date":"2023-06-01","ids":{"openalex":"https://openalex.org/W4378982095","doi":"https://doi.org/10.1145/3603172"},"language":"en","primary_location":{"id":"doi:10.1145/3603172","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3603172","pdf_url":null,"source":{"id":"https://openalex.org/S136160450","display_name":"ACM Transactions on Embedded Computing Systems","issn_l":"1539-9087","issn":["1539-9087","1558-3465"],"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 Embedded 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/A5100351950","display_name":"Lin Zhang","orcid":"https://orcid.org/0000-0003-3708-9056"},"institutions":[{"id":"https://openalex.org/I70983195","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02","country_code":"US","type":"education","lineage":["https://openalex.org/I70983195"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lin Zhang","raw_affiliation_strings":["Syracuse University, USA"],"affiliations":[{"raw_affiliation_string":"Syracuse University, USA","institution_ids":["https://openalex.org/I70983195"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101622957","display_name":"Zifan Wang","orcid":"https://orcid.org/0000-0002-8961-4302"},"institutions":[{"id":"https://openalex.org/I70983195","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02","country_code":"US","type":"education","lineage":["https://openalex.org/I70983195"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zifan Wang","raw_affiliation_strings":["Syracuse University, USA"],"affiliations":[{"raw_affiliation_string":"Syracuse University, USA","institution_ids":["https://openalex.org/I70983195"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007560139","display_name":"Fanxin Kong","orcid":"https://orcid.org/0000-0002-2174-1620"},"institutions":[{"id":"https://openalex.org/I70983195","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02","country_code":"US","type":"education","lineage":["https://openalex.org/I70983195"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Fanxin Kong","raw_affiliation_strings":["Syracuse University, USA"],"affiliations":[{"raw_affiliation_string":"Syracuse University, USA","institution_ids":["https://openalex.org/I70983195"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100351950"],"corresponding_institution_ids":["https://openalex.org/I70983195"],"apc_list":null,"apc_paid":null,"fwci":1.3912,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.81879521,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"22","issue":"4","first_page":"1","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","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/T10772","display_name":"Distributed systems and fault tolerance","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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9993000030517578,"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/T13553","display_name":"Age of Information Optimization","score":0.9873999953269958,"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.8956141471862793},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.8219225406646729},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5464942455291748},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.520287811756134},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5164316296577454},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5134249925613403},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5122408270835876},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5092993974685669},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.5010030269622803},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4791140556335449},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.46010032296180725},{"id":"https://openalex.org/keywords/sequential-consistency","display_name":"Sequential consistency","score":0.4522155523300171},{"id":"https://openalex.org/keywords/consistency-model","display_name":"Consistency model","score":0.4145331084728241},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.4131143093109131},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2909037470817566},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2396242916584015},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.18572384119033813}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8956141471862793},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8219225406646729},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5464942455291748},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.520287811756134},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5164316296577454},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5134249925613403},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5122408270835876},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5092993974685669},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.5010030269622803},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4791140556335449},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.46010032296180725},{"id":"https://openalex.org/C82029504","wikidata":"https://www.wikidata.org/wiki/Q4373882","display_name":"Sequential consistency","level":4,"score":0.4522155523300171},{"id":"https://openalex.org/C37279795","wikidata":"https://www.wikidata.org/wiki/Q2492305","display_name":"Consistency model","level":3,"score":0.4145331084728241},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.4131143093109131},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2909037470817566},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2396242916584015},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.18572384119033813},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3603172","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3603172","pdf_url":null,"source":{"id":"https://openalex.org/S136160450","display_name":"ACM Transactions on Embedded Computing Systems","issn_l":"1539-9087","issn":["1539-9087","1558-3465"],"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 Embedded Computing Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4692700466","display_name":"Collaborative Research: CPS: Medium: Sensor Attack Detection and Recovery in Cyber-Physical Systems","funder_award_id":"2143256","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G539730668","display_name":null,"funder_award_id":"CNS-2143256","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W128180137","https://openalex.org/W1508221334","https://openalex.org/W1923741182","https://openalex.org/W1966771895","https://openalex.org/W1980576963","https://openalex.org/W1981663184","https://openalex.org/W2005748875","https://openalex.org/W2009739781","https://openalex.org/W2074787299","https://openalex.org/W2086184665","https://openalex.org/W2093091899","https://openalex.org/W2100970777","https://openalex.org/W2104260476","https://openalex.org/W2119018856","https://openalex.org/W2129300220","https://openalex.org/W2133553843","https://openalex.org/W2139302123","https://openalex.org/W2140362910","https://openalex.org/W2152844070","https://openalex.org/W2160779498","https://openalex.org/W2165646063","https://openalex.org/W2345302610","https://openalex.org/W2510140370","https://openalex.org/W2530955710","https://openalex.org/W2552129899","https://openalex.org/W2615583738","https://openalex.org/W2798493418","https://openalex.org/W2803684864","https://openalex.org/W2809058022","https://openalex.org/W2893554781","https://openalex.org/W3023640600","https://openalex.org/W3041006851","https://openalex.org/W3044661437","https://openalex.org/W3116568908","https://openalex.org/W3180236906","https://openalex.org/W3200969900","https://openalex.org/W4212971776","https://openalex.org/W4224932126","https://openalex.org/W4236854509","https://openalex.org/W4250119831","https://openalex.org/W4250470202","https://openalex.org/W4255048146","https://openalex.org/W4285182148","https://openalex.org/W4293024011","https://openalex.org/W4381785762","https://openalex.org/W6752330615","https://openalex.org/W6755038706"],"related_works":["https://openalex.org/W2044887272","https://openalex.org/W246909719","https://openalex.org/W1885534640","https://openalex.org/W1906213980","https://openalex.org/W2036306661","https://openalex.org/W2105768184","https://openalex.org/W2505917360","https://openalex.org/W118795575","https://openalex.org/W1738788207","https://openalex.org/W2949499328"],"abstract_inverted_index":{"Real-time":[0],"systems":[1,133],"are":[2],"susceptible":[3],"to":[4,13,23,77,92,131],"adversarial":[5],"factors":[6],"such":[7],"as":[8],"faults":[9],"and":[10,34,68,106,108,116,124,136,148,157,162,164],"attacks,":[11],"leading":[12],"severe":[14],"consequences.":[15],"This":[16],"paper":[17],"presents":[18],"an":[19],"optimal":[20,71,103],"checkpoint":[21,53,72,104],"scheme":[22],"bolster":[24],"fault":[25,86],"resilience":[26],"in":[27,127,134],"real-time":[28],"systems,":[29],"addressing":[30],"both":[31],"logical":[32,54],"consistency":[33],"timing":[35],"correctness.":[36],"First,":[37],"we":[38,57,109],"partition":[39],"message-passing":[40],"processes":[41],"into":[42],"a":[43,117,122],"directed":[44],"acyclic":[45],"graph":[46],"(DAG)":[47],"based":[48],"on":[49],"their":[50],"dependencies,":[51],"ensuring":[52],"consistency.":[55],"Then,":[56],"identify":[58],"the":[59,64,70,88,93,102,137],"DAG\u2019s":[60],"critical":[61],"path,":[62,67],"representing":[63],"longest":[65],"sequential":[66],"analyze":[69],"strategy":[73,144],"along":[74],"this":[75],"path":[76],"minimize":[78],"overall":[79],"execution":[80,128],"time,":[81],"including":[82],"checkpointing":[83],"overhead.":[84],"Upon":[85],"detection,":[87],"system":[89],"rolls":[90],"back":[91],"nearest":[94],"valid":[95],"checkpoints":[96],"for":[97,159,166],"recovery.":[98],"Our":[99],"algorithm":[100],"derives":[101],"count":[105],"intervals,":[107],"evaluate":[110],"its":[111],"performance":[112],"through":[113],"extensive":[114],"simulations":[115,135],"case":[118,138],"study.":[119],"Results":[120],"show":[121],"99.97%":[123],"67.86%":[125],"reduction":[126],"time":[129],"compared":[130],"checkpoint-free":[132],"study,":[139],"respectively.":[140],"Moreover,":[141],"our":[142],"proposed":[143],"outperforms":[145],"prior":[146],"work":[147],"baseline":[149],"methods,":[150],"increasing":[151],"deadline":[152],"achievement":[153],"rates":[154],"by":[155],"31.41%":[156],"2.92%":[158],"small-scale":[160],"tasks":[161],"78.53%":[163],"4.15%":[165],"large-scale":[167],"tasks.":[168]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}
