{"id":"https://openalex.org/W2079559808","doi":"https://doi.org/10.1145/1142980.1142989","title":"Simultaneous placement with clustering and duplication","display_name":"Simultaneous placement with clustering and duplication","publication_year":2004,"publication_date":"2004-06-07","ids":{"openalex":"https://openalex.org/W2079559808","doi":"https://doi.org/10.1145/1142980.1142989","mag":"2079559808"},"language":"en","primary_location":{"id":"doi:10.1145/1142980.1142989","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1142980.1142989","pdf_url":null,"source":{"id":"https://openalex.org/S105046310","display_name":"ACM Transactions on Design Automation of Electronic Systems","issn_l":"1084-4309","issn":["1084-4309","1557-7309"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Design Automation of Electronic Systems","raw_type":"journal-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/A5100389323","display_name":"Gang Chen","orcid":"https://orcid.org/0000-0003-3157-0172"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gang Chen","raw_affiliation_strings":["Magma Design Automation, Santa Clara, CA","Magma Design Autom., Santa Clara, CA#TAB#"],"affiliations":[{"raw_affiliation_string":"Magma Design Automation, Santa Clara, CA","institution_ids":[]},{"raw_affiliation_string":"Magma Design Autom., Santa Clara, CA#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016776689","display_name":"Jason Cong","orcid":"https://orcid.org/0000-0003-2887-6963"},"institutions":[{"id":"https://openalex.org/I2799798094","display_name":"UCLA Health","ror":"https://ror.org/01d88se56","country_code":"US","type":"funder","lineage":["https://openalex.org/I2799798094"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jason Cong","raw_affiliation_strings":["UCLA, Los Angeles, CA","UCLA, Los, Angeles, CA"],"affiliations":[{"raw_affiliation_string":"UCLA, Los Angeles, CA","institution_ids":["https://openalex.org/I2799798094"]},{"raw_affiliation_string":"UCLA, Los, Angeles, CA","institution_ids":["https://openalex.org/I2799798094"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100389323"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3388,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.6449604,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"11","issue":"3","first_page":"740","last_page":"772"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998999834060669,"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":0.9998999834060669,"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.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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9987000226974487,"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/computer-science","display_name":"Computer science","score":0.7659624814987183},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6533319354057312},{"id":"https://openalex.org/keywords/field-programmable-gate-array","display_name":"Field-programmable gate array","score":0.5792886018753052},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5312376022338867},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.4479835629463196},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4337650239467621},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4117574989795685},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.39289355278015137},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3781971335411072},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30968165397644043},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3084682822227478},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.21704241633415222},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17572075128555298},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.1208375096321106},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10549291968345642}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7659624814987183},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6533319354057312},{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.5792886018753052},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5312376022338867},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4479835629463196},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4337650239467621},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4117574989795685},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39289355278015137},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3781971335411072},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30968165397644043},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3084682822227478},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.21704241633415222},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17572075128555298},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.1208375096321106},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10549291968345642},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1142980.1142989","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1142980.1142989","pdf_url":null,"source":{"id":"https://openalex.org/S105046310","display_name":"ACM Transactions on Design Automation of Electronic Systems","issn_l":"1084-4309","issn":["1084-4309","1557-7309"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Design Automation of Electronic Systems","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.62.523","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.523","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cadlab.cs.ucla.edu/~cong/papers/p740-chen.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7200000286102295}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W111129777","https://openalex.org/W1511688816","https://openalex.org/W1575153928","https://openalex.org/W2002641171","https://openalex.org/W2094806828","https://openalex.org/W2100735755","https://openalex.org/W2104066908","https://openalex.org/W2105715355","https://openalex.org/W2107960880","https://openalex.org/W2111756578","https://openalex.org/W2121244114","https://openalex.org/W2139637699","https://openalex.org/W2148548599","https://openalex.org/W2153119762","https://openalex.org/W2159221249","https://openalex.org/W2165081508","https://openalex.org/W2168048050","https://openalex.org/W2600578627","https://openalex.org/W2914931491","https://openalex.org/W4235935333","https://openalex.org/W6630623413"],"related_works":["https://openalex.org/W2132921321","https://openalex.org/W2065006817","https://openalex.org/W2129550502","https://openalex.org/W2116465486","https://openalex.org/W2101572961","https://openalex.org/W1995629993","https://openalex.org/W1759713541","https://openalex.org/W2551933747","https://openalex.org/W2045633099","https://openalex.org/W2135694842"],"abstract_inverted_index":{"Clustering,":[0],"duplication,":[1],"and":[2,22,54,63,68,74,139,171,197,229,267],"placement":[3,60,71,111,211],"are":[4],"critical":[5,120],"steps":[6],"in":[7,144,182,223,231,245],"a":[8,15,25,42,80,94,99,102,105,126,136,140,157,160,191,199,206,246],"cluster-based":[9],"FPGA":[10,168,210,248],"design":[11],"flow.":[12],"Clustering":[13],"has":[14],"great":[16],"impact":[17],"on":[18,45],"the":[19,38,114,119,133,148,186,224,232],"wirelength,":[20],"timing,":[21],"routability":[23],"of":[24,41,97,101,135,159,221],"circuit.":[26,43],"Logic":[27],"duplication":[28,69],"is":[29,152],"an":[30,52,173,218],"effective":[31,55,88],"method":[32,96],"for":[33,72,86],"improving":[34],"performance":[35],"while":[36],"maintaining":[37],"logic":[39],"equivalence":[40],"Based":[44],"several":[46],"novel":[47,95],"algorithmic":[48],"contributions,":[49],"we":[50,78,92,130,155,189],"present":[51],"efficient":[53],"algorithm":[56,177,204,240,262],"named":[57],"SPCD":[58,203,239,261],"(simultaneous":[59],"with":[61,217],"clustering":[62,67,115,169],"duplication)":[64],"which":[65,145],"performs":[66],"during":[70,110,123],"wirelength":[73],"timing":[75,89],"minimization.":[76],"First,":[77],"incorporate":[79],"path":[81,121,150,226],"counting-based":[82],"net":[83],"weighting":[84],"scheme":[85],"more":[87,127],"optimization.":[90],"Secondly,":[91],"introduce":[93,132,156],"moving":[98],"fragment":[100,106],"cluster":[103],"(called":[104],"level":[107],"move":[108],")":[109],"to":[112,147,164,184,241],"optimize":[113],"structure.":[116],"To":[117],"reduce":[118,185],"detour":[122,151],"legalization":[124,176],"from":[125],"global":[128,141,193],"perspective,":[129],"also":[131,236],"notions":[134],"monotone":[137,142],"region":[138,143],"improvement":[146],"local/global":[149],"guaranteed.":[153],"Furthermore,":[154],"notion":[158],"constrained":[161],"gain":[162],"graph":[163],"embed":[165],"all":[166],"complex":[167],"constraints,":[170],"implement":[172],"optimal":[174],"incremental":[175],"under":[178],"such":[179],"constraints.":[180],"Finally,":[181],"order":[183],"circuit":[187],"area,":[188],"formulate":[190],"timing-constrained":[192],"redundancy":[194],"removal":[195],"problem":[196],"propose":[198],"heuristic":[200],"solution.":[201],"Our":[202],"outperforms":[205,263,268],"widely":[207],"used":[208],"academic":[209],"flow,":[212],"T-VPack":[213],"+":[214],"VPR":[215,264],",":[216],"average":[219],"reduction":[220],"31%":[222],"longest":[225],"estimate":[227],"delay":[228],"18%":[230],"routed":[233,256],"delay.":[234],"We":[235],"apply":[237],"our":[238,260],"Altera's":[242],"Stratix":[243],"architecture":[244],"commercial":[247],"implementation":[249],"flow":[250],"(":[251],"Quartus":[252,269],"II":[253,270],"4.0).":[254],"The":[255],"result":[257],"achieved":[258],"by":[259,265,272],"20%":[266],"4.0":[271],"4%.":[273]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":6},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}