{"id":"https://openalex.org/W2475424379","doi":"https://doi.org/10.1109/rait.2016.7507959","title":"An ILP-based floorplan-aware path synthesis technique for Application-Specific NoC design","display_name":"An ILP-based floorplan-aware path synthesis technique for Application-Specific NoC design","publication_year":2016,"publication_date":"2016-03-01","ids":{"openalex":"https://openalex.org/W2475424379","doi":"https://doi.org/10.1109/rait.2016.7507959","mag":"2475424379"},"language":"en","primary_location":{"id":"doi:10.1109/rait.2016.7507959","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rait.2016.7507959","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 3rd International Conference on Recent Advances in Information Technology (RAIT)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5102008188","display_name":"Priyajit Mukherjee","orcid":"https://orcid.org/0000-0001-9561-3683"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Priyajit Mukherjee","raw_affiliation_strings":["Department of Electronics and Electrical Communication Engineering, Indian Institute of Technology, Kharagpur, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronics and Electrical Communication Engineering, Indian Institute of Technology, Kharagpur, India","institution_ids":["https://openalex.org/I145894827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077947010","display_name":"Santanu Chattopadhyay","orcid":"https://orcid.org/0000-0002-1227-0732"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Santanu Chattopadhyay","raw_affiliation_strings":["Department of Electronics and Electrical Communication Engineering, Indian Institute of Technology, Kharagpur, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronics and Electrical Communication Engineering, Indian Institute of Technology, Kharagpur, India","institution_ids":["https://openalex.org/I145894827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I145894827"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0504553,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"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/T10829","display_name":"Interconnection Networks and Systems","score":1.0,"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":1.0,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9951000213623047,"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/floorplan","display_name":"Floorplan","score":0.8952325582504272},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7299659252166748},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5359296202659607},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.48136574029922485},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4783294200897217},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.43245354294776917},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4320524036884308},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.419938325881958},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3592947721481323},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25501179695129395},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.20235991477966309},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20212817192077637},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15572702884674072},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.10860073566436768}],"concepts":[{"id":"https://openalex.org/C130145326","wikidata":"https://www.wikidata.org/wiki/Q1553985","display_name":"Floorplan","level":2,"score":0.8952325582504272},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7299659252166748},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5359296202659607},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.48136574029922485},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4783294200897217},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.43245354294776917},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4320524036884308},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.419938325881958},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3592947721481323},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25501179695129395},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.20235991477966309},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20212817192077637},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15572702884674072},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.10860073566436768},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rait.2016.7507959","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rait.2016.7507959","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 3rd International Conference on Recent Advances in Information Technology (RAIT)","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":14,"referenced_works":["https://openalex.org/W1546837845","https://openalex.org/W1974843053","https://openalex.org/W2077224856","https://openalex.org/W2091518118","https://openalex.org/W2092929971","https://openalex.org/W2095998827","https://openalex.org/W2118231264","https://openalex.org/W2123905442","https://openalex.org/W2153580689","https://openalex.org/W2159856958","https://openalex.org/W2163320987","https://openalex.org/W2165437459","https://openalex.org/W2171825402","https://openalex.org/W2544157911"],"related_works":["https://openalex.org/W2055008360","https://openalex.org/W2135118255","https://openalex.org/W1500063550","https://openalex.org/W215057456","https://openalex.org/W2165891825","https://openalex.org/W2106366463","https://openalex.org/W1535718467","https://openalex.org/W4231092740","https://openalex.org/W4239364405","https://openalex.org/W4251805775"],"abstract_inverted_index":{"In":[0,91],"Application-Specific":[1],"Networks-on-Chip,":[2],"both":[3],"positions":[4,42],"of":[5,43,48,96,112,124],"the":[6,9,16,32,40,69,76,104,109,113,122],"routers":[7,49,58,120,129],"and":[8,45,127,154,170,188],"routes":[10],"for":[11,100,151],"each":[12,66],"communication":[13,110],"trace":[14],"in":[15,50,68,103,184],"Core":[17,70,105],"Graph":[18,106],"can":[19],"be":[20],"adjusted":[21],"to":[22,31,73,107,136,158],"suit":[23],"a":[24,36,46,63,80,94,133,138,155],"particular":[25,81],"application.":[26],"For":[27,65],"an":[28,74,146,181],"application,":[29,75],"input":[30],"current":[33],"work":[34,116],"is":[35,59,98,165],"gridded":[37],"floorplan":[38],"having":[39],"fixed":[41],"cores":[44],"set":[47,95],"it.":[51],"Maximum":[52],"physical":[53],"link":[54,141],"length":[55],"between":[56,87],"two":[57,88,125],"also":[60,117],"considered":[61],"as":[62],"constraint.":[64],"edge":[67],"Graph,":[71],"corresponding":[72],"proposed":[77,145,163],"method":[78,164],"selects":[79],"path":[82,152,174],"from":[83],"all":[84,101],"possible":[85],"paths,":[86],"grid":[89],"points.":[90],"this":[92],"way,":[93],"paths":[97,126],"constructed":[99],"edges":[102],"minimize":[108],"cost":[111],"design.":[114],"This":[115],"inserts":[118],"junction":[119],"at":[121],"junctions":[123],"secondary":[128],"or":[130],"repeaters":[131],"on":[132],"long":[134],"link,":[135],"sustain":[137],"pre-specified":[139],"maximum":[140],"length.":[142],"We":[143],"have":[144],"Integer":[147],"Linear":[148],"Programming":[149],"formulation":[150],"synthesis":[153],"heuristic":[156],"approach":[157],"generate":[159],"alternative":[160],"paths.":[161],"The":[162,178],"tested":[166],"with":[167,172],"benchmark":[168],"applications":[169],"compared":[171],"shortest":[173],"based":[175],"greedy":[176],"approaches.":[177],"results":[179],"show":[180],"immense":[182],"improvement":[183],"average":[185],"packet":[186],"latency":[187],"throughput":[189],"using":[190],"our":[191],"method.":[192]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}