{"id":"https://openalex.org/W2154668695","doi":"https://doi.org/10.1109/ipdps.2004.1303119","title":"Non-contiguous linear placement for reconfigurable fabrics","display_name":"Non-contiguous linear placement for reconfigurable fabrics","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W2154668695","doi":"https://doi.org/10.1109/ipdps.2004.1303119","mag":"2154668695"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2004.1303119","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1303119","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","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/A5086561910","display_name":"Cristinel Ababei","orcid":"https://orcid.org/0000-0002-7609-5304"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"C. Ababei","raw_affiliation_strings":["Electrical and Computer Engineering Department, University of Minnesota, Minneapolis, MN, USA"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013257804","display_name":"Kia Bazargan","orcid":"https://orcid.org/0000-0003-3624-7366"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Bazargan","raw_affiliation_strings":["Electrical and Computer Engineering Department, University of Minnesota, Minneapolis, MN, USA"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086561910"],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":null,"apc_paid":null,"fwci":2.6409,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.89412052,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"141","last_page":"148"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","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"}},"topics":[{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","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/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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/reuse","display_name":"Reuse","score":0.7756199240684509},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6550716161727905},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5106585621833801},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.49187469482421875},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44312241673469543},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.42480504512786865},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.35620978474617004},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33183741569519043},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3278639316558838},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22711241245269775},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09640190005302429},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06975886225700378}],"concepts":[{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.7756199240684509},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6550716161727905},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5106585621833801},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49187469482421875},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44312241673469543},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.42480504512786865},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.35620978474617004},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33183741569519043},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3278639316558838},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22711241245269775},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09640190005302429},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06975886225700378},{"id":"https://openalex.org/C548081761","wikidata":"https://www.wikidata.org/wiki/Q180388","display_name":"Waste management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ipdps.2004.1303119","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1303119","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.79.4068","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.4068","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.umn.edu/users/kia/Papers/2004/RAW04_linearPlc.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.46000000834465027,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W135031542","https://openalex.org/W153263486","https://openalex.org/W157706557","https://openalex.org/W1760305469","https://openalex.org/W1961777338","https://openalex.org/W1975085273","https://openalex.org/W2048167605","https://openalex.org/W2068041061","https://openalex.org/W2076639376","https://openalex.org/W2079966248","https://openalex.org/W2091966794","https://openalex.org/W2097869799","https://openalex.org/W2116345141","https://openalex.org/W2117285153","https://openalex.org/W2137080878","https://openalex.org/W2139697722","https://openalex.org/W2168675540","https://openalex.org/W4248091655","https://openalex.org/W4249006057","https://openalex.org/W6606200970","https://openalex.org/W6606411226","https://openalex.org/W6640837814","https://openalex.org/W6674913702","https://openalex.org/W6677750074"],"related_works":["https://openalex.org/W2384475851","https://openalex.org/W2000444236","https://openalex.org/W2353602216","https://openalex.org/W2367078749","https://openalex.org/W2381798600","https://openalex.org/W1910583078","https://openalex.org/W2351618306","https://openalex.org/W2133117170","https://openalex.org/W2999162218","https://openalex.org/W1537443268"],"abstract_inverted_index":{"Summary":[0],"form":[1],"only":[2],"given.":[3],"We":[4],"present":[5],"efficient":[6,57,95],"solutions":[7],"for":[8,16,24,53,75,92],"the":[9,25,63,85,99,117],"noncontiguous":[10,67,102,120],"linear":[11,79],"placement":[12,68,103,121],"of":[13,66,84,101,119],"data":[14],"paths":[15],"reconfigurable":[17,26],"fabrics.":[18],"A":[19,28,110],"strip-based":[20],"architecture":[21],"is":[22,35,88,113],"assumed":[23],"fabric.":[27],"preorder":[29],"tree-expression":[30],"or":[31],"a":[32,38,93],"general":[33],"graph":[34],"placed":[36],"in":[37],"strip,":[39],"which":[40],"can":[41],"have":[42],"active":[43,106],"and/or":[44,50],"inactive":[45,108],"preplaced":[46],"cores":[47,51],"representing":[48],"blockages":[49,70],"available":[52],"reuse.":[54,127],"Two":[55],"very":[56],"algorithms":[58,87],"are":[59,130],"proposed":[60,114],"to":[61,97,115],"solve":[62,98,116],"simpler":[64],"problem":[65,100,118],"with":[69,82,104,122],"but":[71],"without":[72],"core":[73,124],"reuse":[74],"tree":[76],"graphs.":[77],"The":[78],"ordering":[80],"obtained":[81],"any":[83],"above":[86],"used":[89],"as":[90],"input":[91],"third":[94],"algorithm":[96,112],"both":[105,123],"and":[107,125],"cores.":[109],"fourth":[111],"connectivity":[126],"Simulations":[128],"results":[129],"reported.":[131]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}