{"id":"https://openalex.org/W1998133543","doi":"https://doi.org/10.1109/sies.2011.5953690","title":"Towards an efficient approach for resource sharing in real-time multiprocessor systems","display_name":"Towards an efficient approach for resource sharing in real-time multiprocessor systems","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W1998133543","doi":"https://doi.org/10.1109/sies.2011.5953690","mag":"1998133543"},"language":"en","primary_location":{"id":"doi:10.1109/sies.2011.5953690","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sies.2011.5953690","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 6th IEEE International Symposium on Industrial and Embedded Systems","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/A5049223063","display_name":"Moris Behnam","orcid":"https://orcid.org/0000-0002-1687-930X"},"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"]},{"id":"https://openalex.org/I2799978770","display_name":"X-Fab (Germany)","ror":"https://ror.org/030bh9196","country_code":"DE","type":"company","lineage":["https://openalex.org/I2799978770"]}],"countries":["DE","SE"],"is_corresponding":true,"raw_author_name":"Moris Behnam","raw_affiliation_strings":["Mälardalen Real-Time Research Centre, P.O. Box 883, SE-721 23 Västerås, Sweden","M\u00e4lardalen Real-Time Research Centre, P.O. Box 883, SE-721 23 V\u00e4ster\u00e5s, Sweden"],"affiliations":[{"raw_affiliation_string":"Mälardalen Real-Time Research Centre, P.O. Box 883, SE-721 23 Västerås, Sweden","institution_ids":["https://openalex.org/I2799978770"]},{"raw_affiliation_string":"M\u00e4lardalen Real-Time Research Centre, P.O. Box 883, SE-721 23 V\u00e4ster\u00e5s, Sweden","institution_ids":["https://openalex.org/I82509713"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065490699","display_name":"Farhang Nemati","orcid":null},"institutions":[{"id":"https://openalex.org/I2799978770","display_name":"X-Fab (Germany)","ror":"https://ror.org/030bh9196","country_code":"DE","type":"company","lineage":["https://openalex.org/I2799978770"]},{"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":["DE","SE"],"is_corresponding":false,"raw_author_name":"Farhang Nemati","raw_affiliation_strings":["Mälardalen Real-Time Research Centre, P.O. Box 883, SE-721 23 Västerås, Sweden","M\u00e4lardalen Real-Time Research Centre, P.O. Box 883, SE-721 23 V\u00e4ster\u00e5s, Sweden"],"affiliations":[{"raw_affiliation_string":"Mälardalen Real-Time Research Centre, P.O. Box 883, SE-721 23 Västerås, Sweden","institution_ids":["https://openalex.org/I2799978770"]},{"raw_affiliation_string":"M\u00e4lardalen Real-Time Research Centre, P.O. Box 883, SE-721 23 V\u00e4ster\u00e5s, Sweden","institution_ids":["https://openalex.org/I82509713"]}]},{"author_position":"middle","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"]},{"id":"https://openalex.org/I2799978770","display_name":"X-Fab (Germany)","ror":"https://ror.org/030bh9196","country_code":"DE","type":"company","lineage":["https://openalex.org/I2799978770"]}],"countries":["DE","SE"],"is_corresponding":false,"raw_author_name":"Thomas Nolte","raw_affiliation_strings":["Mälardalen Real-Time Research Centre, P.O. Box 883, SE-721 23 Västerås, Sweden","M\u00e4lardalen Real-Time Research Centre, P.O. Box 883, SE-721 23 V\u00e4ster\u00e5s, Sweden"],"affiliations":[{"raw_affiliation_string":"Mälardalen Real-Time Research Centre, P.O. Box 883, SE-721 23 Västerås, Sweden","institution_ids":["https://openalex.org/I2799978770"]},{"raw_affiliation_string":"M\u00e4lardalen Real-Time Research Centre, P.O. Box 883, SE-721 23 V\u00e4ster\u00e5s, Sweden","institution_ids":["https://openalex.org/I82509713"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032002580","display_name":"H\u00e5kan Grahn","orcid":"https://orcid.org/0000-0001-9947-1088"},"institutions":[{"id":"https://openalex.org/I52719799","display_name":"Blekinge Institute of Technology","ror":"https://ror.org/0093a8w51","country_code":"SE","type":"education","lineage":["https://openalex.org/I52719799"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"H\u00e5kan Grahn","raw_affiliation_strings":["School of Computing, Blekinge Institute of Technology, SE-371 79 Karlskrona, Sweden"],"affiliations":[{"raw_affiliation_string":"School of Computing, Blekinge Institute of Technology, SE-371 79 Karlskrona, Sweden","institution_ids":["https://openalex.org/I52719799"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5049223063"],"corresponding_institution_ids":["https://openalex.org/I2799978770","https://openalex.org/I82509713"],"apc_list":null,"apc_paid":null,"fwci":0.2519,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.53326334,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"99","last_page":"102"},"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9805999994277954,"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.9794999957084656,"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.8440104722976685},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.735802412033081},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.6894354820251465},{"id":"https://openalex.org/keywords/shared-resource","display_name":"Shared resource","score":0.6484078168869019},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5989106893539429},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.5578038692474365},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4579249322414398},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.4377530813217163},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4352736473083496},{"id":"https://openalex.org/keywords/resource-management","display_name":"Resource management (computing)","score":0.4185265600681305},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3088722229003906},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.23154059052467346},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.06710097193717957}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8440104722976685},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.735802412033081},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.6894354820251465},{"id":"https://openalex.org/C51332947","wikidata":"https://www.wikidata.org/wiki/Q1172305","display_name":"Shared resource","level":2,"score":0.6484078168869019},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5989106893539429},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.5578038692474365},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4579249322414398},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.4377530813217163},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4352736473083496},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.4185265600681305},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3088722229003906},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.23154059052467346},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.06710097193717957},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sies.2011.5953690","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sies.2011.5953690","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 6th IEEE International Symposium on Industrial and Embedded Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1664327184","https://openalex.org/W1847396493","https://openalex.org/W1902431847","https://openalex.org/W1905332030","https://openalex.org/W1937593182","https://openalex.org/W1963645828","https://openalex.org/W2093100591","https://openalex.org/W2094478725","https://openalex.org/W2100980563","https://openalex.org/W2108382220","https://openalex.org/W2111910505","https://openalex.org/W2126697758","https://openalex.org/W2143006785","https://openalex.org/W2144541685","https://openalex.org/W2147347162","https://openalex.org/W2156324992","https://openalex.org/W2160293203","https://openalex.org/W2164164245","https://openalex.org/W2166004747","https://openalex.org/W2166092565","https://openalex.org/W2166718050","https://openalex.org/W2477294255","https://openalex.org/W6681220924","https://openalex.org/W6682761234","https://openalex.org/W6684293806"],"related_works":["https://openalex.org/W2104524790","https://openalex.org/W2923452570","https://openalex.org/W206598027","https://openalex.org/W2978610750","https://openalex.org/W1487555369","https://openalex.org/W2022931285","https://openalex.org/W1589966275","https://openalex.org/W2086872282","https://openalex.org/W2137789903","https://openalex.org/W2153007255"],"abstract_inverted_index":{"Supporting":[0],"resource":[1,34,122],"sharing":[2],"in":[3,71],"multiprocessor":[4],"architectures":[5,21],"is":[6],"one":[7],"of":[8,18,38,60,84],"the":[9,14,58,62,76,82,87,100,110,116,125,134],"major":[10],"problems":[11],"that":[12,79,123],"limit":[13],"potential":[15],"performance":[16],"benefits":[17],"using":[19],"such":[20],"for":[22,120],"real-time":[23],"systems.":[24],"Many":[25],"approaches":[26,64,67],"and":[27,65,86,113],"algorithms":[28],"have":[29],"been":[30],"proposed":[31],"to":[32,73,109,130],"support":[33],"sharing,":[35],"however,":[36],"most":[37],"them":[39],"impose":[40],"either":[41],"high":[42],"blocking":[43,77,103,126,137],"times":[44,78,127],"on":[45,98,105,128],"tasks":[46,85,129],"or":[47],"require":[48],"a":[49,95],"large":[50],"memory":[51,118],"allocation.":[52],"In":[53],"this":[54],"paper":[55],"we":[56,93],"investigate":[57],"possibility":[59],"combining":[61],"lock-based":[63],"wait-free":[66],"(using":[68],"multiple":[69],"buffers)":[70],"order":[72],"decrease":[74],"both":[75],"may":[80],"affect":[81],"schedulability":[83,111],"required":[88],"memory.":[89],"To":[90],"achieve":[91],"this,":[92],"propose":[94],"solution":[96],"based":[97],"evaluating":[99],"maximum":[101,135],"allowed":[102,136],"time":[104],"each":[106,121],"task":[107],"according":[108],"analysis,":[112],"then":[114],"find":[115],"minimum":[117],"allocation":[119],"limits":[124],"be":[131],"less":[132],"than":[133],"times.":[138]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}