{"id":"https://openalex.org/W3152236992","doi":"https://doi.org/10.1109/aspdac.2010.5419892","title":"Constrained global scheduling of streaming applications on MPSoCs","display_name":"Constrained global scheduling of streaming applications on MPSoCs","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W3152236992","doi":"https://doi.org/10.1109/aspdac.2010.5419892","mag":"3152236992"},"language":"en","primary_location":{"id":"doi:10.1109/aspdac.2010.5419892","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2010.5419892","pdf_url":null,"source":null,"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 15th 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/A5109135386","display_name":"Jun Zhu","orcid":"https://orcid.org/0000-0003-4489-7510"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Jun Zhu","raw_affiliation_strings":["Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024461213","display_name":"Ingo Sander","orcid":"https://orcid.org/0000-0003-4859-3100"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Ingo Sander","raw_affiliation_strings":["Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032163732","display_name":"Axel Jantsch","orcid":"https://orcid.org/0000-0003-2251-0004"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Axel Jantsch","raw_affiliation_strings":["Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5109135386"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":2.1367,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.88915546,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"223","last_page":"228"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9991999864578247,"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.842181921005249},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6342320442199707},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5686099529266357},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5036670565605164},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5034021735191345},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.4741867482662201},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.42375537753105164},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.42059147357940674},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4148935377597809},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.38962796330451965},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2784349322319031},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.22334414720535278},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.1963806450366974}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.842181921005249},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6342320442199707},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5686099529266357},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5036670565605164},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5034021735191345},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.4741867482662201},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.42375537753105164},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.42059147357940674},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4148935377597809},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.38962796330451965},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2784349322319031},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.22334414720535278},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.1963806450366974},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/aspdac.2010.5419892","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2010.5419892","pdf_url":null,"source":null,"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 15th Asia and South Pacific Design Automation Conference (ASP-DAC)","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":19,"referenced_works":["https://openalex.org/W1534452453","https://openalex.org/W1595333718","https://openalex.org/W1867684417","https://openalex.org/W2011039300","https://openalex.org/W2033872646","https://openalex.org/W2089335052","https://openalex.org/W2105784795","https://openalex.org/W2120431055","https://openalex.org/W2120538858","https://openalex.org/W2131111769","https://openalex.org/W2143111385","https://openalex.org/W2148147784","https://openalex.org/W2157504696","https://openalex.org/W2161767397","https://openalex.org/W2164084134","https://openalex.org/W4236002048","https://openalex.org/W6679217443","https://openalex.org/W6679491442","https://openalex.org/W6683641807"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2167574351","https://openalex.org/W2372008037","https://openalex.org/W2377713709","https://openalex.org/W2397293317","https://openalex.org/W2393789493","https://openalex.org/W4300092030","https://openalex.org/W2172075652","https://openalex.org/W2978148977","https://openalex.org/W2060984508"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,75],"global":[3,23],"scheduling":[4,24,40,57,109],"framework":[5,72],"for":[6,86],"synchronous":[7],"data":[8],"flow":[9],"(SDF)":[10],"streaming":[11],"applications":[12,87],"on":[13,16],"MPSoCs,":[14],"based":[15,35],"optimized":[17],"computation":[18],"and":[19,28],"contention-free":[20],"routing.":[21],"The":[22],"of":[25],"processors":[26],"computing":[27],"communication":[29,89],"transactions":[30],"are":[31],"formulated":[32],"as":[33],"constraint":[34,49,63],"problem,":[36],"to":[37,53,94,104],"avoid":[38],"the":[39,55,70,107],"overhead":[41],"in":[42,88],"TDMA-like":[43],"heuristic":[44,108],"schemes.":[45],"A":[46],"public":[47],"domain":[48],"solver":[50],"is":[51],"exploited":[52],"solve":[54],"NP-complete":[56],"efficiently,":[58],"together":[59],"with":[60,80,99],"problem":[61],"specific":[62],"modeling":[64],"techniques.":[65],"Experimental":[66],"results":[67],"show":[68],"that":[69],"proposed":[71],"can":[73],"achieve":[74],"high":[76],"predictable":[77],"application":[78],"throughput":[79,92],"minimized":[81],"buffer":[82,101],"cost.":[83],"For":[84],"instance,":[85],"domain,":[90],"higher":[91],"(up":[93],"87%)":[95],"has":[96],"been":[97],"observed":[98],"less":[100],"cost,":[102],"compared":[103],"scenarios":[105],"considering":[106],"overhead.":[110]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}