{"id":"https://openalex.org/W1546650277","doi":"https://doi.org/10.1109/etfa.2003.1247703","title":"Server-based scheduling of the CAN bus","display_name":"Server-based scheduling of the CAN bus","publication_year":2004,"publication_date":"2004-03-30","ids":{"openalex":"https://openalex.org/W1546650277","doi":"https://doi.org/10.1109/etfa.2003.1247703","mag":"1546650277"},"language":"en","primary_location":{"id":"doi:10.1109/etfa.2003.1247703","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa.2003.1247703","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EFTA 2003. 2003 IEEE Conference on Emerging Technologies and Factory Automation. Proceedings (Cat. No.03TH8696)","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/A5047385412","display_name":"Thomas Nolte","orcid":"https://orcid.org/0000-0001-6132-7945"},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"T. Nolte","raw_affiliation_strings":["M\u00e4lardalen Real-Time Research Centre Department of Computer Science and Engineering, M\u00e4ardalen University V\u00e4ster\u00e5s, Sweden","Department of Computer Science and Engineering, M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden"],"affiliations":[{"raw_affiliation_string":"M\u00e4lardalen Real-Time Research Centre Department of Computer Science and Engineering, M\u00e4ardalen University V\u00e4ster\u00e5s, Sweden","institution_ids":["https://openalex.org/I82509713"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden","institution_ids":["https://openalex.org/I82509713"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052013615","display_name":"Mikael Sj\u00f6din","orcid":"https://orcid.org/0000-0001-7586-0409"},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"M. Sjodin","raw_affiliation_strings":["M\u00e4lardalen Real-Time Research Centre Department of Computer Science and Engineering, M\u00e4ardalen University V\u00e4ster\u00e5s, Sweden","Department of Computer Science and Engineering, M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden"],"affiliations":[{"raw_affiliation_string":"M\u00e4lardalen Real-Time Research Centre Department of Computer Science and Engineering, M\u00e4ardalen University V\u00e4ster\u00e5s, Sweden","institution_ids":["https://openalex.org/I82509713"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden","institution_ids":["https://openalex.org/I82509713"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010093986","display_name":"Hans Hansson","orcid":"https://orcid.org/0000-0002-7235-6888"},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"H. Hansson","raw_affiliation_strings":["M\u00e4lardalen Real-Time Research Centre Department of Computer Science and Engineering, M\u00e4ardalen University V\u00e4ster\u00e5s, Sweden","Department of Computer Science and Engineering, M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden"],"affiliations":[{"raw_affiliation_string":"M\u00e4lardalen Real-Time Research Centre Department of Computer Science and Engineering, M\u00e4ardalen University V\u00e4ster\u00e5s, Sweden","institution_ids":["https://openalex.org/I82509713"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden","institution_ids":["https://openalex.org/I82509713"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047385412"],"corresponding_institution_ids":["https://openalex.org/I82509713"],"apc_list":null,"apc_paid":null,"fwci":3.4332,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.91827275,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"1","issue":null,"first_page":"169","last_page":"176"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9994999766349792,"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.9994999766349792,"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.9603999853134155,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9577999711036682,"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.8309502601623535},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5973606109619141},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5594661235809326},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5321813225746155},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.5152326226234436},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.5150244235992432},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5145182013511658},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5074312090873718},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.5013539791107178},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4450390934944153},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.44147148728370667},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.42277389764785767},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.08281582593917847}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8309502601623535},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5973606109619141},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5594661235809326},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5321813225746155},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.5152326226234436},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.5150244235992432},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5145182013511658},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5074312090873718},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.5013539791107178},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4450390934944153},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.44147148728370667},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.42277389764785767},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.08281582593917847},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/etfa.2003.1247703","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa.2003.1247703","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EFTA 2003. 2003 IEEE Conference on Emerging Technologies and Factory Automation. Proceedings (Cat. No.03TH8696)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.14.7227","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.7227","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mrtc.mdh.se/publications/0534.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.6.3565","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.3565","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mrtc.mdh.se/publications/0553.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320940","display_name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning","ror":"https://ror.org/044wr7g58"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W116292536","https://openalex.org/W1587568087","https://openalex.org/W1600850084","https://openalex.org/W1611475125","https://openalex.org/W2000642048","https://openalex.org/W2042979415","https://openalex.org/W2109488193","https://openalex.org/W2111831392","https://openalex.org/W2115611292","https://openalex.org/W2116577794","https://openalex.org/W2120028254","https://openalex.org/W2121342001","https://openalex.org/W2133620741","https://openalex.org/W2137490515","https://openalex.org/W2164854480","https://openalex.org/W2176566884","https://openalex.org/W2262960161","https://openalex.org/W2555657893","https://openalex.org/W2570030068","https://openalex.org/W2617960267","https://openalex.org/W2726481301","https://openalex.org/W3200688358","https://openalex.org/W4229595915","https://openalex.org/W4244955909","https://openalex.org/W6636023224"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W1545991362","https://openalex.org/W4300092030","https://openalex.org/W2167574351","https://openalex.org/W3184267879","https://openalex.org/W1935185185","https://openalex.org/W2545511463","https://openalex.org/W2404383452","https://openalex.org/W2372008037","https://openalex.org/W2106332846"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"present":[4],"a":[5,108,118],"new":[6],"share-driven":[7,46],"server-based":[8,53,86],"method":[9,42,48,106],"for":[10,50,88],"scheduling":[11,47,54,74,87],"messages":[12,114],"sent":[13],"over":[14],"the":[15,36,39,44,67,81,95],"controller":[16],"area":[17],"network":[18,68],"(CAN).":[19],"Share-driven":[20],"methods":[21],"are":[22,115],"useful":[23],"in":[24],"many":[25],"applications,":[26],"since":[27],"they":[28,102],"provide":[29],"both":[30],"fairness":[31],"and":[32,83,101],"bandwidth":[33,96],"isolation":[34,97],"among":[35],"users":[37],"of":[38,66,85],"resource.":[40],"Our":[41,52],"is":[43,55,99],"first":[45,60],"proposed":[49],"CAN.":[51,89],"based":[56],"on":[57],"earliest":[58],"deadline":[59],"(EDF),":[61],"which":[62],"allows":[63],"higher":[64],"utilization":[65],"than":[69],"using":[70],"CAN's":[71],"native":[72],"fixed-priority":[73],"approach.":[75],"We":[76],"use":[77],"simulation":[78,91],"to":[79],"show":[80,93,103],"performance":[82],"properties":[84],"The":[90],"results":[92],"that":[94,104],"property":[98],"kept,":[100],"our":[105],"provides":[107],"quality-of-service":[109],"(QoS),":[110],"where":[111],"virtually":[112],"all":[113],"delivered":[116],"within":[117],"specified":[119],"time.":[120]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}