{"id":"https://openalex.org/W4248906860","doi":"https://doi.org/10.1109/aspdac.2018.8297382","title":"Scheduling multi-rate real-time applications on clustered many-core architectures with memory constraints","display_name":"Scheduling multi-rate real-time applications on clustered many-core architectures with memory constraints","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W4248906860","doi":"https://doi.org/10.1109/aspdac.2018.8297382"},"language":"en","primary_location":{"id":"doi:10.1109/aspdac.2018.8297382","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2018.8297382","pdf_url":null,"source":{"id":"https://openalex.org/S4363608266","display_name":"2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)","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/A5051286450","display_name":"Matthias Becker","orcid":"https://orcid.org/0000-0002-1276-3609"},"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":"Matthias Becker","raw_affiliation_strings":["MRTC/M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden"],"affiliations":[{"raw_affiliation_string":"MRTC/M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden","institution_ids":["https://openalex.org/I82509713"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026480732","display_name":"Saad Mubeen","orcid":"https://orcid.org/0000-0003-3242-6113"},"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":"Saad Mubeen","raw_affiliation_strings":["MRTC/M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden"],"affiliations":[{"raw_affiliation_string":"MRTC/M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden","institution_ids":["https://openalex.org/I82509713"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041319859","display_name":"Dakshina Dasari","orcid":"https://orcid.org/0000-0002-6130-349X"},"institutions":[{"id":"https://openalex.org/I889804353","display_name":"Robert Bosch (Germany)","ror":"https://ror.org/01fe0jt45","country_code":"DE","type":"company","lineage":["https://openalex.org/I889804353"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dakshina Dasari","raw_affiliation_strings":["Corporate Research, Robert Bosch GmbH, Renningen, Germany"],"affiliations":[{"raw_affiliation_string":"Corporate Research, Robert Bosch GmbH, Renningen, Germany","institution_ids":["https://openalex.org/I889804353"]}]},{"author_position":"middle","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"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Moris Behnam","raw_affiliation_strings":["MRTC/M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden"],"affiliations":[{"raw_affiliation_string":"MRTC/M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden","institution_ids":["https://openalex.org/I82509713"]}]},{"author_position":"last","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":false,"raw_author_name":"Thomas Nolte","raw_affiliation_strings":["MRTC/M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden"],"affiliations":[{"raw_affiliation_string":"MRTC/M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden","institution_ids":["https://openalex.org/I82509713"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5051286450"],"corresponding_institution_ids":["https://openalex.org/I82509713"],"apc_list":null,"apc_paid":null,"fwci":3.66045142,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.933687,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9995999932289124,"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.9995999932289124,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.984499990940094,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9835000038146973,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8654527068138123},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.6321535110473633},{"id":"https://openalex.org/keywords/uniform-memory-access","display_name":"Uniform memory access","score":0.61014723777771},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.523733377456665},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5216332077980042},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5208735466003418},{"id":"https://openalex.org/keywords/distributed-shared-memory","display_name":"Distributed shared memory","score":0.4875299632549286},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.45933592319488525},{"id":"https://openalex.org/keywords/distributed-memory","display_name":"Distributed memory","score":0.4388432204723358},{"id":"https://openalex.org/keywords/interleaved-memory","display_name":"Interleaved memory","score":0.4186094105243683},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.33003437519073486},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.14425510168075562},{"id":"https://openalex.org/keywords/overlay","display_name":"Overlay","score":0.12612423300743103}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8654527068138123},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.6321535110473633},{"id":"https://openalex.org/C51290061","wikidata":"https://www.wikidata.org/wiki/Q1936765","display_name":"Uniform memory access","level":4,"score":0.61014723777771},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.523733377456665},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5216332077980042},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5208735466003418},{"id":"https://openalex.org/C39528615","wikidata":"https://www.wikidata.org/wiki/Q1229610","display_name":"Distributed shared memory","level":5,"score":0.4875299632549286},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.45933592319488525},{"id":"https://openalex.org/C91481028","wikidata":"https://www.wikidata.org/wiki/Q1054686","display_name":"Distributed memory","level":3,"score":0.4388432204723358},{"id":"https://openalex.org/C63511323","wikidata":"https://www.wikidata.org/wiki/Q908936","display_name":"Interleaved memory","level":4,"score":0.4186094105243683},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.33003437519073486},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.14425510168075562},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.12612423300743103},{"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.1109/aspdac.2018.8297382","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2018.8297382","pdf_url":null,"source":{"id":"https://openalex.org/S4363608266","display_name":"2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5699999928474426,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W80656426","https://openalex.org/W235776801","https://openalex.org/W877499849","https://openalex.org/W1024612211","https://openalex.org/W1853228870","https://openalex.org/W1965732719","https://openalex.org/W1978631345","https://openalex.org/W1993079513","https://openalex.org/W1996576378","https://openalex.org/W2105996829","https://openalex.org/W2122969894","https://openalex.org/W2136208128","https://openalex.org/W2141440050","https://openalex.org/W2233391390","https://openalex.org/W2345030503","https://openalex.org/W2464992489","https://openalex.org/W2504945220","https://openalex.org/W2528730658","https://openalex.org/W2536304952","https://openalex.org/W2602063133","https://openalex.org/W2730881954","https://openalex.org/W2759667261","https://openalex.org/W4253375448","https://openalex.org/W6603314764","https://openalex.org/W6626598149","https://openalex.org/W6680476547","https://openalex.org/W6689897037","https://openalex.org/W6740679999"],"related_works":["https://openalex.org/W2026512611","https://openalex.org/W4245497162","https://openalex.org/W1985165680","https://openalex.org/W2138180780","https://openalex.org/W120214571","https://openalex.org/W254684032","https://openalex.org/W52481882","https://openalex.org/W43633106","https://openalex.org/W1824582190","https://openalex.org/W2247651031"],"abstract_inverted_index":{"Access":[0],"to":[1,28,36,40,80,87,112,119,134,149],"shared":[2,29,41,88],"memory":[3,30,45,72,92],"is":[4,57,67,94,110],"one":[5],"of":[6,15,25,78,102],"the":[7,23,38,84,100,114,121,128],"main":[8],"challenges":[9],"for":[10,18],"many-core":[11],"processors.":[12],"One":[13],"group":[14],"scheduling":[16],"strategies":[17],"such":[19,49,103],"platforms":[20],"focuses":[21],"on":[22],"division":[24],"tasks'":[26],"access":[27,39,51,85,93],"and":[31,43,96,118,142],"code":[32],"execution.":[33],"This":[34,82],"allows":[35],"orchestrate":[37],"local":[42,71],"off-chip":[44,91],"in":[46,97],"a":[47,76,143],"way":[48],"that":[50,69,127],"contention":[52],"between":[53],"different":[54],"compute":[55],"cores":[56],"avoided":[58],"by":[59,73],"design.":[60],"In":[61],"this":[62],"work,":[63,141],"an":[64,132],"execution":[65],"framework":[66],"introduced":[68],"leverages":[70],"statically":[74,115],"allocating":[75],"subset":[77],"tasks":[79,117],"cores.":[81],"reduces":[83],"times":[86],"memory,":[89],"as":[90],"avoided,":[95],"turn":[98],"improves":[99],"schedulability":[101,137],"systems.":[104],"A":[105],"Constraint":[106],"Programming":[107],"(CP)":[108],"formulation":[109],"presented":[111],"select":[113],"allocated":[116],"generate":[120],"complete":[122],"system":[123],"schedule.":[124],"Evaluations":[125],"show":[126],"proposed":[129],"approach":[130],"yields":[131],"up":[133],"19%":[135],"higher":[136],"ratio":[138],"than":[139],"related":[140],"case":[144],"study":[145],"demonstrates":[146],"its":[147],"applicability":[148],"industrial":[150],"problems.":[151]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}