{"id":"https://openalex.org/W2049876586","doi":"https://doi.org/10.1109/reconfig.2014.7032540","title":"Net reordering and multicommodity flow based global routing for FPGAs","display_name":"Net reordering and multicommodity flow based global routing for FPGAs","publication_year":2014,"publication_date":"2014-12-01","ids":{"openalex":"https://openalex.org/W2049876586","doi":"https://doi.org/10.1109/reconfig.2014.7032540","mag":"2049876586"},"language":"en","primary_location":{"id":"doi:10.1109/reconfig.2014.7032540","is_oa":false,"landing_page_url":"https://doi.org/10.1109/reconfig.2014.7032540","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 International Conference on ReConFigurable Computing and FPGAs (ReConFig14)","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/A5086561910","display_name":"Cristinel Ababei","orcid":"https://orcid.org/0000-0002-7609-5304"},"institutions":[{"id":"https://openalex.org/I102461120","display_name":"Marquette University","ror":"https://ror.org/04gr4te78","country_code":"US","type":"education","lineage":["https://openalex.org/I102461120"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cristinel Ababei","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Marquette University, Milwaukee, WI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Marquette University, Milwaukee, WI, USA","institution_ids":["https://openalex.org/I102461120"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040420034","display_name":"Rajesh Kavasseri","orcid":"https://orcid.org/0000-0002-4444-8136"},"institutions":[{"id":"https://openalex.org/I57328836","display_name":"North Dakota State University","ror":"https://ror.org/05h1bnb22","country_code":"US","type":"education","lineage":["https://openalex.org/I57328836"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rajesh G. Kavasseri","raw_affiliation_strings":["Department of Electrical and Computer Engineering, North Dakota State University, Fargo, ND, USA","Department of Electrical and Computer Engineering North Dakota State University  Fargo ND USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, North Dakota State University, Fargo, ND, USA","institution_ids":["https://openalex.org/I57328836"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering North Dakota State University  Fargo ND USA","institution_ids":["https://openalex.org/I57328836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054704713","display_name":"Mohammad A. Zare","orcid":null},"institutions":[{"id":"https://openalex.org/I57328836","display_name":"North Dakota State University","ror":"https://ror.org/05h1bnb22","country_code":"US","type":"education","lineage":["https://openalex.org/I57328836"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammad A. Zare","raw_affiliation_strings":["Department of Electrical and Computer Engineering, North Dakota State University, Fargo, ND, USA","Department of Electrical and Computer Engineering North Dakota State University  Fargo ND USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, North Dakota State University, Fargo, ND, USA","institution_ids":["https://openalex.org/I57328836"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering North Dakota State University  Fargo ND USA","institution_ids":["https://openalex.org/I57328836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14368764,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":1.0,"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.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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9997000098228455,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.7304196357727051},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.6794574856758118},{"id":"https://openalex.org/keywords/pathfinder","display_name":"Pathfinder","score":0.6621699333190918},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6371467709541321},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5576300621032715},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.48495200276374817},{"id":"https://openalex.org/keywords/field-programmable-gate-array","display_name":"Field-programmable gate array","score":0.4260184168815613},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.42313116788864136},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42254048585891724},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4221838116645813},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35002052783966064},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.26008617877960205},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24470409750938416},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.21495330333709717},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.1582559049129486},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.09803047776222229},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.08667194843292236}],"concepts":[{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.7304196357727051},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.6794574856758118},{"id":"https://openalex.org/C2778940482","wikidata":"https://www.wikidata.org/wiki/Q7144753","display_name":"Pathfinder","level":2,"score":0.6621699333190918},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6371467709541321},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5576300621032715},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.48495200276374817},{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.4260184168815613},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.42313116788864136},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42254048585891724},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4221838116645813},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35002052783966064},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.26008617877960205},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24470409750938416},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.21495330333709717},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.1582559049129486},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.09803047776222229},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.08667194843292236},{"id":"https://openalex.org/C161191863","wikidata":"https://www.wikidata.org/wiki/Q199655","display_name":"Library science","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/reconfig.2014.7032540","is_oa":false,"landing_page_url":"https://doi.org/10.1109/reconfig.2014.7032540","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 International Conference on ReConFigurable Computing and FPGAs (ReConFig14)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.708.4490","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.708.4490","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dejazzer.com/doc/2014_reconfig_reordering.pdf","raw_type":"text"},{"id":"pmh:oai:epublications.marquette.edu:electric_fac-1076","is_oa":false,"landing_page_url":"https://epublications.marquette.edu/cgi/viewcontent.cgi?article=1076&context=electric_fac","pdf_url":null,"source":{"id":"https://openalex.org/S4306401682","display_name":"e-Publications@Marquette (Marquette University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102461120","host_organization_name":"Marquette University","host_organization_lineage":["https://openalex.org/I102461120"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Electrical and Computer Engineering Faculty Research and Publications","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320313814","display_name":"Marquette University","ror":"https://ror.org/04gr4te78"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1523051745","https://openalex.org/W1552962745","https://openalex.org/W1588701277","https://openalex.org/W1648759184","https://openalex.org/W1916650455","https://openalex.org/W2002886574","https://openalex.org/W2010997912","https://openalex.org/W2020899710","https://openalex.org/W2106515083","https://openalex.org/W2121244114","https://openalex.org/W2139637699","https://openalex.org/W2144655684","https://openalex.org/W2150439955","https://openalex.org/W2159622217","https://openalex.org/W2159800085","https://openalex.org/W2275304190","https://openalex.org/W2481108008","https://openalex.org/W4238070904","https://openalex.org/W6640180554","https://openalex.org/W6655608801","https://openalex.org/W6676151202","https://openalex.org/W6678158601","https://openalex.org/W6680692090"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W3127002380","https://openalex.org/W2068473861","https://openalex.org/W2889464401","https://openalex.org/W757657516","https://openalex.org/W2351878639","https://openalex.org/W2539097916","https://openalex.org/W2136173851","https://openalex.org/W2029407480","https://openalex.org/W4253436398"],"abstract_inverted_index":{"The":[0,67,86],"most":[1,68],"popular":[2,69],"algorithm":[3,79],"for":[4,9,20,59,232],"solving":[5,243],"the":[6,18,21,41,77,82,89,95,105,114,126,137,148,166,175,186,213,217,220,226,237,253],"routing":[7,46,60,74,90,106,131,135,142,149,221,239,256],"problem":[8,121],"field":[10],"programmable":[11],"gate":[12],"arrays":[13],"(FPGAs)":[14],"has":[15],"virtually":[16],"remained":[17],"same":[19],"past":[22],"two":[23,178],"decades.":[24],"It":[25],"is":[26,76,109,144],"essentially":[27],"an":[28,244],"iterative":[29],"maze":[30],"technique,":[31],"such":[32,72],"as":[33,113],"Dijkstra's":[34],"algorithm,":[35],"applied":[36],"to":[37,56,63,112,181,195,199],"each":[38,103,134],"net":[39,115,167],"in":[40,97,170,188],"circuit":[42,65],"repeatedly.":[43],"During":[44],"multiple":[45],"iterations,":[47],"nets":[48,99,190,200,211,234],"are":[49,100,191],"ripped-up":[50,192],"and":[51,193,204],"rerouted":[52,194],"via":[53],"different":[54],"paths":[55],"resolve":[57],"competition":[58],"resources":[61],"or":[62],"improve":[64],"delay.":[66],"implementation":[70],"of":[71,88,104,125,139,155,177,219],"a":[73,141],"approach":[75],"PathFinder":[78,118],"used":[80],"inside":[81],"VPR":[83],"tool":[84],"[1].":[85],"quality":[87,218],"solution":[91,240],"depends":[92],"however":[93],"on":[94,147,216,236],"order":[96,187],"which":[98,189],"processed":[101],"during":[102,159,229],"iterations.":[107],"This":[108],"commonly":[110],"referred":[111],"ordering":[116,168],"problem.":[117,248],"addresses":[119],"this":[120,171],"through":[122],"continuous":[123],"updates":[124],"cost":[127,138,227],"associated":[128],"with":[129,201],"overusing":[130,140],"resources.":[132],"After":[133],"iteration,":[136],"resource":[143],"increased":[145],"based":[146,235],"so":[150,152],"far,":[151],"that":[153,252],"probability":[154],"resolving":[156],"all":[157],"congestion":[158],"future":[160],"iterations":[161],"increases.":[162],"To":[163],"further":[164],"address":[165],"problem,":[169],"paper,":[172],"we":[173,224],"investigate":[174],"effectiveness":[176],"combined":[179],"techniques":[180],"enhance":[182],"PathFinder.":[183],"We":[184],"change":[185],"give":[196],"higher":[197],"priority":[198],"two,":[202],"three,":[203],"more":[205],"than":[206],"eleven":[207],"pins":[208],"because":[209],"these":[210],"have":[212],"largest":[214],"impact":[215],"solution.":[222],"Also,":[223],"alter":[225],"calculation":[228],"wave":[230],"expansions":[231],"two-pin":[233],"global":[238],"obtained":[241],"by":[242],"equivalent":[245],"multicommodity":[246],"flow":[247],"Preliminary":[249],"results":[250],"suggest":[251],"conventional":[254],"FPGA":[255],"solutions":[257],"can":[258],"still":[259],"be":[260],"improved.":[261]},"counts_by_year":[],"updated_date":"2026-08-11T07:18:39.950985","created_date":"2025-10-10T00:00:00"}