{"id":"https://openalex.org/W2899469535","doi":"https://doi.org/10.1109/etfa.2018.8502621","title":"Weakly-Hard Real-Time Guarantees for Weighted Round-Robin Scheduling of Real-Time Messages","display_name":"Weakly-Hard Real-Time Guarantees for Weighted Round-Robin Scheduling of Real-Time Messages","publication_year":2018,"publication_date":"2018-09-01","ids":{"openalex":"https://openalex.org/W2899469535","doi":"https://doi.org/10.1109/etfa.2018.8502621","mag":"2899469535"},"language":"en","primary_location":{"id":"doi:10.1109/etfa.2018.8502621","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa.2018.8502621","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","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/A5039410874","display_name":"Zain A. H. Hammadeh","orcid":"https://orcid.org/0000-0001-7539-2393"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Zain A. H. Hammadeh","raw_affiliation_strings":["TU, Braunschweig, Germany"],"affiliations":[{"raw_affiliation_string":"TU, Braunschweig, Germany","institution_ids":["https://openalex.org/I94509681"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075507551","display_name":"Rolf Ernst","orcid":"https://orcid.org/0000-0003-2414-9566"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rolf Ernst","raw_affiliation_strings":["TU, Braunschweig, Germany"],"affiliations":[{"raw_affiliation_string":"TU, Braunschweig, Germany","institution_ids":["https://openalex.org/I94509681"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5039410874"],"corresponding_institution_ids":["https://openalex.org/I94509681"],"apc_list":null,"apc_paid":null,"fwci":0.2525,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.52224395,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"384","last_page":"391"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","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/T10933","display_name":"Real-Time Systems Scheduling","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/T11125","display_name":"Petri Nets in System Modeling","score":0.9868999719619751,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.984499990940094,"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.8490549325942993},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6786410808563232},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6462415456771851},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5970314145088196},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5682480335235596},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.5168721675872803},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.4332282245159149},{"id":"https://openalex.org/keywords/response-time","display_name":"Response time","score":0.4191347360610962},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.41771307587623596},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.3767377734184265},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.2448793351650238},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.23694738745689392},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21140122413635254},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1927257776260376},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08546578884124756},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.07452109456062317},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07223513722419739}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8490549325942993},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6786410808563232},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6462415456771851},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5970314145088196},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5682480335235596},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.5168721675872803},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.4332282245159149},{"id":"https://openalex.org/C19012869","wikidata":"https://www.wikidata.org/wiki/Q578372","display_name":"Response time","level":2,"score":0.4191347360610962},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.41771307587623596},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.3767377734184265},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.2448793351650238},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.23694738745689392},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21140122413635254},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1927257776260376},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08546578884124756},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.07452109456062317},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07223513722419739},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/etfa.2018.8502621","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa.2018.8502621","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","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":27,"referenced_works":["https://openalex.org/W1544936738","https://openalex.org/W1678112703","https://openalex.org/W1807119923","https://openalex.org/W1984121220","https://openalex.org/W1990050126","https://openalex.org/W1997998060","https://openalex.org/W2015717967","https://openalex.org/W2036645810","https://openalex.org/W2064316219","https://openalex.org/W2096535721","https://openalex.org/W2114254390","https://openalex.org/W2133620399","https://openalex.org/W2136343147","https://openalex.org/W2140441767","https://openalex.org/W2140710806","https://openalex.org/W2141440050","https://openalex.org/W2145071552","https://openalex.org/W2165172064","https://openalex.org/W2169778797","https://openalex.org/W2404730416","https://openalex.org/W2741413319","https://openalex.org/W2760380815","https://openalex.org/W2810997923","https://openalex.org/W4241644614","https://openalex.org/W6679986215","https://openalex.org/W6684791310","https://openalex.org/W6753353778"],"related_works":["https://openalex.org/W2374555443","https://openalex.org/W2393789493","https://openalex.org/W2367142822","https://openalex.org/W2352790745","https://openalex.org/W2060984508","https://openalex.org/W2182592860","https://openalex.org/W2076947091","https://openalex.org/W1552447518","https://openalex.org/W2383668729","https://openalex.org/W4300092030"],"abstract_inverted_index":{"Communication":[0],"resources":[1],"often":[2],"exist":[3],"in":[4,71,113],"distributed":[5],"real-time":[6,40,44,69,84],"systems,":[7,45],"therefore,":[8],"providing":[9],"guarantees":[10,70],"on":[11],"a":[12,17,75],"predefined":[13],"end-to-end":[14],"deadline":[15,58,76,102],"requires":[16],"timing":[18,47],"analysis":[19,27,48,112],"of":[20,55,74,99,110],"the":[21,31,46,53,56,72,92,97,100,108],"communication":[22],"resource.":[23],"Worst-case":[24],"response":[25],"time":[26],"techniques":[28],"for":[29,38,83],"guaranteeing":[30],"system's":[32],"schedulability":[33],"are":[34],"not":[35],"expressive":[36],"enough":[37],"weakly-hard":[39,43,68],"systems.":[41],"In":[42,63],"ought":[49],"to":[50],"ensure":[51],"that":[52],"distribution":[54],"system":[57],"misses/mets":[59],"is":[60],"precisely":[61],"bounded.":[62],"this":[64],"paper,":[65],"we":[66],"compute":[67],"form":[73],"miss":[77,103],"model":[78],"using":[79],"Typical":[80],"Worst-Case":[81],"Analysis":[82],"messages":[85],"with":[86],"weighted":[87],"round-robin":[88],"scheduling.":[89],"We":[90,105],"evaluate":[91],"proposed":[93],"analysis's":[94],"scalability":[95],"and":[96],"tightness":[98],"computed":[101],"models.":[104],"illustrate":[106],"also":[107],"applicability":[109],"our":[111],"an":[114],"industrial":[115],"case":[116],"study.":[117]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}