{"id":"https://openalex.org/W2068195712","doi":"https://doi.org/10.1145/1086228.1086292","title":"Semantics-preserving and memory-efficient implementation of inter-task communication on static-priority or EDF schedulers","display_name":"Semantics-preserving and memory-efficient implementation of inter-task communication on static-priority or EDF schedulers","publication_year":2005,"publication_date":"2005-09-18","ids":{"openalex":"https://openalex.org/W2068195712","doi":"https://doi.org/10.1145/1086228.1086292","mag":"2068195712"},"language":"en","primary_location":{"id":"doi:10.1145/1086228.1086292","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1086228.1086292","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th ACM international conference on Embedded software","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/A5080042319","display_name":"Stavros Tripakis","orcid":"https://orcid.org/0000-0002-1777-493X"},"institutions":[{"id":"https://openalex.org/I4210156361","display_name":"Verimag","ror":"https://ror.org/05afmzm11","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210156361","https://openalex.org/I4210159245","https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"S. Tripakis","raw_affiliation_strings":["Verimag laboratory, Gi\u00e8res, France"],"affiliations":[{"raw_affiliation_string":"Verimag laboratory, Gi\u00e8res, France","institution_ids":["https://openalex.org/I4210156361"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033675277","display_name":"Christos Sofronis","orcid":null},"institutions":[{"id":"https://openalex.org/I4210156361","display_name":"Verimag","ror":"https://ror.org/05afmzm11","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210156361","https://openalex.org/I4210159245","https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"C. Sofronis","raw_affiliation_strings":["Verimag laboratory, Gi\u00e8res, France"],"affiliations":[{"raw_affiliation_string":"Verimag laboratory, Gi\u00e8res, France","institution_ids":["https://openalex.org/I4210156361"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110275533","display_name":"Norman Scaife","orcid":null},"institutions":[{"id":"https://openalex.org/I4210156361","display_name":"Verimag","ror":"https://ror.org/05afmzm11","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210156361","https://openalex.org/I4210159245","https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"N. Scaife","raw_affiliation_strings":["Verimag laboratory, Gi\u00e8res, France"],"affiliations":[{"raw_affiliation_string":"Verimag laboratory, Gi\u00e8res, France","institution_ids":["https://openalex.org/I4210156361"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112434469","display_name":"P. Caspi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210156361","display_name":"Verimag","ror":"https://ror.org/05afmzm11","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210156361","https://openalex.org/I4210159245","https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"P. Caspi","raw_affiliation_strings":["Verimag laboratory, Gi\u00e8res, France"],"affiliations":[{"raw_affiliation_string":"Verimag laboratory, Gi\u00e8res, France","institution_ids":["https://openalex.org/I4210156361"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5080042319"],"corresponding_institution_ids":["https://openalex.org/I4210156361"],"apc_list":null,"apc_paid":null,"fwci":4.8984,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.95227466,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"353","last_page":"360"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9998000264167786,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9998000264167786,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9997000098228455,"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/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.8710911273956299},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7350510358810425},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6237643361091614},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6138470768928528},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.5978062152862549},{"id":"https://openalex.org/keywords/priority-inheritance","display_name":"Priority inheritance","score":0.5621412992477417},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5519525408744812},{"id":"https://openalex.org/keywords/priority-ceiling-protocol","display_name":"Priority ceiling protocol","score":0.5050848126411438},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.4582904577255249},{"id":"https://openalex.org/keywords/deadline-monotonic-scheduling","display_name":"Deadline-monotonic scheduling","score":0.4568520188331604},{"id":"https://openalex.org/keywords/priority-inversion","display_name":"Priority inversion","score":0.43231499195098877},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.43008774518966675},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4278152585029602},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.41478031873703003},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.31693679094314575},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.24771985411643982},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.23122546076774597},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.14253464341163635}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8710911273956299},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7350510358810425},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6237643361091614},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6138470768928528},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.5978062152862549},{"id":"https://openalex.org/C63160601","wikidata":"https://www.wikidata.org/wiki/Q253831","display_name":"Priority inheritance","level":5,"score":0.5621412992477417},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5519525408744812},{"id":"https://openalex.org/C117420606","wikidata":"https://www.wikidata.org/wiki/Q386027","display_name":"Priority ceiling protocol","level":5,"score":0.5050848126411438},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.4582904577255249},{"id":"https://openalex.org/C76774629","wikidata":"https://www.wikidata.org/wiki/Q1146103","display_name":"Deadline-monotonic scheduling","level":5,"score":0.4568520188331604},{"id":"https://openalex.org/C172828308","wikidata":"https://www.wikidata.org/wiki/Q520734","display_name":"Priority inversion","level":5,"score":0.43231499195098877},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.43008774518966675},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4278152585029602},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.41478031873703003},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.31693679094314575},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.24771985411643982},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23122546076774597},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.14253464341163635},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1086228.1086292","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1086228.1086292","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th ACM international conference on Embedded software","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1552578721","https://openalex.org/W1586502670","https://openalex.org/W1789765244","https://openalex.org/W1874725288","https://openalex.org/W2012001501","https://openalex.org/W2045465854","https://openalex.org/W2071229589","https://openalex.org/W2072953737","https://openalex.org/W2109488193","https://openalex.org/W2116912109","https://openalex.org/W2119133945","https://openalex.org/W2159542925","https://openalex.org/W2262960161","https://openalex.org/W2491188924","https://openalex.org/W4242915164","https://openalex.org/W4242946303"],"related_works":["https://openalex.org/W2364408853","https://openalex.org/W2372058405","https://openalex.org/W1591583623","https://openalex.org/W2385139534","https://openalex.org/W2186454171","https://openalex.org/W1496705289","https://openalex.org/W2383192442","https://openalex.org/W2001673593","https://openalex.org/W2464659810","https://openalex.org/W2377321505"],"abstract_inverted_index":{"In":[0,54],"previous":[1],"work,":[2],"we":[3,57,103],"have":[4],"proposed":[5],"a":[6,23,42,78],"method":[7,60],"of":[8,13,19,51,67,92,114],"preserving":[9],"the":[10,17,59,65,98,115],"functional":[11,100],"semantics":[12],"model-based":[14],"designs":[15],"by":[16],"use":[18],"static":[20,79],"checks":[21],"and":[22,35,71],"double-buffer":[24],"protocol":[25,94],"[12].":[26],"However,":[27],"this":[28,55],"is":[29,76],"restricted":[30],"to":[31,38,45,61,111],"static,":[32],"fixed-priority":[33],"scheduling":[34,63,70,75],"for":[36,48],"high-priority":[37],"low-priority":[39],"communications":[40],"requires":[41],"double":[43],"buffer":[44],"be":[46,84,109],"stored":[47],"each":[49],"pair":[50],"communicating":[52],"tasks.":[53],"paper":[56],"extend":[58],"dynamic-priority":[62],"in":[64],"form":[66],"earliest-deadline-first":[68],"(EDF)":[69],"show":[72,104],"that,":[73],"although":[74],"dynamic,":[77],"buffering":[80],"scheme":[81],"can":[82,108],"still":[83,96],"used.":[85],"We":[86],"also":[87],"suggest":[88],"some":[89],"memory":[90],"optimizations":[91],"our":[93],"which":[95],"preserve":[97],"original":[99],"semantics.":[101],"Finally,":[102],"how":[105],"model":[106],"checking":[107],"used":[110],"prove":[112],"correctness":[113],"scheme.":[116]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}