{"id":"https://openalex.org/W4245932569","doi":"https://doi.org/10.1109/date.2012.6176522","title":"Static scheduling of a Time-Triggered Network-on-Chip based on SMT solving","display_name":"Static scheduling of a Time-Triggered Network-on-Chip based on SMT solving","publication_year":2012,"publication_date":"2012-03-01","ids":{"openalex":"https://openalex.org/W4245932569","doi":"https://doi.org/10.1109/date.2012.6176522"},"language":"en","primary_location":{"id":"doi:10.1109/date.2012.6176522","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2012.6176522","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Design, Automation &amp; Test in Europe Conference &amp; Exhibition (DATE)","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/A5112486362","display_name":"Jia Huang","orcid":"https://orcid.org/0000-0001-7269-6797"},"institutions":[{"id":"https://openalex.org/I4210134795","display_name":"Fortiss","ror":"https://ror.org/042x1tp92","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I4210134795"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Jia Huang","raw_affiliation_strings":["Fortiss GmbH, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Fortiss GmbH, Munich, Germany","institution_ids":["https://openalex.org/I4210134795"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039614631","display_name":"Jan Olaf Blech","orcid":"https://orcid.org/0000-0003-3840-0811"},"institutions":[{"id":"https://openalex.org/I4210134795","display_name":"Fortiss","ror":"https://ror.org/042x1tp92","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I4210134795"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"J. O. Blech","raw_affiliation_strings":["Fortiss GmbH, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Fortiss GmbH, Munich, Germany","institution_ids":["https://openalex.org/I4210134795"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011865955","display_name":"A Raabe","orcid":"https://orcid.org/0000-0001-9574-4501"},"institutions":[{"id":"https://openalex.org/I4210134795","display_name":"Fortiss","ror":"https://ror.org/042x1tp92","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I4210134795"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"A. Raabe","raw_affiliation_strings":["Fortiss GmbH, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Fortiss GmbH, Munich, Germany","institution_ids":["https://openalex.org/I4210134795"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070565751","display_name":"Christian Buckl","orcid":"https://orcid.org/0000-0002-1214-3231"},"institutions":[{"id":"https://openalex.org/I4210134795","display_name":"Fortiss","ror":"https://ror.org/042x1tp92","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I4210134795"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"C. Buckl","raw_affiliation_strings":["Fortiss GmbH, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Fortiss GmbH, Munich, Germany","institution_ids":["https://openalex.org/I4210134795"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063781430","display_name":"Alois Knoll","orcid":"https://orcid.org/0000-0003-4840-076X"},"institutions":[{"id":"https://openalex.org/I4210134795","display_name":"Fortiss","ror":"https://ror.org/042x1tp92","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I4210134795"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"A. Knoll","raw_affiliation_strings":["Fortiss GmbH, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Fortiss GmbH, Munich, Germany","institution_ids":["https://openalex.org/I4210134795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5112486362"],"corresponding_institution_ids":["https://openalex.org/I4210134795"],"apc_list":null,"apc_paid":null,"fwci":1.4184,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.84414836,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"509","last_page":"514"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9995999932289124,"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.9995999932289124,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9994000196456909,"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.9954000115394592,"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.8359899520874023},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.7206499576568604},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.6634643077850342},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.6565470695495605},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.5593744516372681},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5535269975662231},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5515541434288025},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.5137356519699097},{"id":"https://openalex.org/keywords/system-on-a-chip","display_name":"System on a chip","score":0.44237372279167175},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4294854402542114},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4133187532424927},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4113740921020508},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.40613722801208496},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.27363789081573486},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.25886285305023193},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.22689288854599},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.19464275240898132},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.12599918246269226},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08903840184211731},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.08406907320022583},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07450640201568604}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8359899520874023},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7206499576568604},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.6634643077850342},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.6565470695495605},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.5593744516372681},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5535269975662231},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5515541434288025},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.5137356519699097},{"id":"https://openalex.org/C118021083","wikidata":"https://www.wikidata.org/wiki/Q610398","display_name":"System on a chip","level":2,"score":0.44237372279167175},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4294854402542114},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4133187532424927},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4113740921020508},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.40613722801208496},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.27363789081573486},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25886285305023193},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.22689288854599},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19464275240898132},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.12599918246269226},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08903840184211731},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.08406907320022583},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07450640201568604},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/date.2012.6176522","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2012.6176522","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Design, Automation &amp; Test in Europe Conference &amp; Exhibition (DATE)","raw_type":"proceedings-article"},{"id":"pmh:oai:alma.61RMIT_INST:11246831520001341","is_oa":false,"landing_page_url":"http://doi.org/10.1109/DATE.2012.6176522","pdf_url":null,"source":{"id":"https://openalex.org/S4306402074","display_name":"RMIT Research Repository (RMIT University Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I82951845","host_organization_name":"RMIT University","host_organization_lineage":["https://openalex.org/I82951845"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W2048604608","https://openalex.org/W2087412435","https://openalex.org/W2099958378","https://openalex.org/W2102038674","https://openalex.org/W2143176045","https://openalex.org/W2146224977","https://openalex.org/W2159066212","https://openalex.org/W2167572376","https://openalex.org/W3151935685","https://openalex.org/W6675011536"],"related_works":["https://openalex.org/W2578463151","https://openalex.org/W2275420537","https://openalex.org/W1483783534","https://openalex.org/W4379142300","https://openalex.org/W2048447692","https://openalex.org/W4386723279","https://openalex.org/W583460537","https://openalex.org/W2884361050","https://openalex.org/W2497502077","https://openalex.org/W2505717744"],"abstract_inverted_index":{"Time-Triggered":[0],"Network-on-Chip":[1],"(TTNoC)":[2],"is":[3,22],"a":[4,83],"networking":[5],"concept":[6],"aiming":[7],"at":[8],"providing":[9],"both":[10],"predictable":[11],"and":[12,58],"high-throughput":[13],"communication":[14,46],"for":[15,48],"modern":[16],"multiprocessor":[17],"systems.":[18,31],"The":[19,32,102],"message":[20],"scheduling":[21,56],"one":[23],"of":[24,116],"the":[25,54,72,107],"major":[26],"design":[27],"challenges":[28],"in":[29],"TTNoC-based":[30],"designers":[33],"not":[34],"only":[35,113],"need":[36],"to":[37,44],"allocate":[38],"time":[39],"slots":[40],"but":[41],"also":[42],"have":[43],"assign":[45],"routes":[47],"all":[49],"messages.":[50],"This":[51],"paper":[52],"tackles":[53],"TTNoC":[55],"problem":[57,74],"presents":[59],"an":[60,76,91],"approach":[61,93],"based":[62],"on":[63],"Satisfiability":[64],"Modulo":[65],"Theories":[66],"(SMT)":[67],"solving.":[68],"We":[69],"first":[70],"formulate":[71],"complete":[73],"as":[75],"SMT":[77,96],"instance,":[78],"which":[79],"can":[80],"always":[81],"compute":[82],"feasible":[84],"solution":[85],"if":[86],"exists.":[87],"Thereafter,":[88],"we":[89],"propose":[90],"incremental":[92],"that":[94,106],"integrates":[95],"solving":[97],"into":[98],"classical":[99],"heuristic":[100,108],"algorithms.":[101],"experimental":[103],"results":[104],"show":[105],"scales":[109],"significantly":[110],"better":[111],"with":[112],"minor":[114],"loss":[115],"performance.":[117]},"counts_by_year":[{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
