{"id":"https://openalex.org/W2626363895","doi":"https://doi.org/10.1145/3061639.3062215","title":"Convergence-Boosted Graph Partitioning using Maximum Spanning Trees for Iterative Solution of Large Linear Circuits","display_name":"Convergence-Boosted Graph Partitioning using Maximum Spanning Trees for Iterative Solution of Large Linear Circuits","publication_year":2017,"publication_date":"2017-06-13","ids":{"openalex":"https://openalex.org/W2626363895","doi":"https://doi.org/10.1145/3061639.3062215","mag":"2626363895"},"language":"en","primary_location":{"id":"doi:10.1145/3061639.3062215","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3061639.3062215","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual Design Automation Conference 2017","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/A5100341470","display_name":"Ya Wang","orcid":"https://orcid.org/0000-0003-4353-4638"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ya Wang","raw_affiliation_strings":["Texas A&M University, College Station, TX"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100773212","display_name":"Wenrui Zhang","orcid":"https://orcid.org/0000-0002-0223-1924"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wenrui Zhang","raw_affiliation_strings":["Texas A&M University, College Station, TX"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100432782","display_name":"Peng Li","orcid":"https://orcid.org/0000-0003-3548-4589"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peng Li","raw_affiliation_strings":["Texas A&M University, College Station, TX"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069379086","display_name":"Jian Gong","orcid":"https://orcid.org/0000-0001-5786-713X"},"institutions":[{"id":"https://openalex.org/I1343180700","display_name":"Intel (United States)","ror":"https://ror.org/01ek73717","country_code":"US","type":"company","lineage":["https://openalex.org/I1343180700"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jian Gong","raw_affiliation_strings":["Intel Corporation, Hillsboro, OR"],"affiliations":[{"raw_affiliation_string":"Intel Corporation, Hillsboro, OR","institution_ids":["https://openalex.org/I1343180700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100341470"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.06039666,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"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/T10363","display_name":"Low-power high-performance VLSI design","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/T10363","display_name":"Low-power high-performance VLSI design","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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9991999864578247,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.7072576284408569},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.549115777015686},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.5338165760040283},{"id":"https://openalex.org/keywords/preconditioner","display_name":"Preconditioner","score":0.5302574038505554},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5058157444000244},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.49575671553611755},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4408693313598633},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4361855387687683},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.4312227666378021},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4265362024307251},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3345384895801544},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17285415530204773}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7072576284408569},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.549115777015686},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.5338165760040283},{"id":"https://openalex.org/C167431342","wikidata":"https://www.wikidata.org/wiki/Q1754327","display_name":"Preconditioner","level":3,"score":0.5302574038505554},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5058157444000244},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.49575671553611755},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4408693313598633},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4361855387687683},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.4312227666378021},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4265362024307251},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3345384895801544},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17285415530204773},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3061639.3062215","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3061639.3062215","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual Design Automation Conference 2017","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W42717677","https://openalex.org/W1989036882","https://openalex.org/W2048649163","https://openalex.org/W2051989863","https://openalex.org/W2066052393","https://openalex.org/W2077791079","https://openalex.org/W2089024363","https://openalex.org/W2118076222","https://openalex.org/W2127952793","https://openalex.org/W2135277685","https://openalex.org/W2142514638","https://openalex.org/W2146413803","https://openalex.org/W2162785126"],"related_works":["https://openalex.org/W1970414682","https://openalex.org/W2283235658","https://openalex.org/W2325733899","https://openalex.org/W3022662421","https://openalex.org/W2066041241","https://openalex.org/W2140784834","https://openalex.org/W3120468868","https://openalex.org/W1567048268","https://openalex.org/W1970273404","https://openalex.org/W4285325102"],"abstract_inverted_index":{"The":[0,96,161,181,204],"ability":[1],"to":[2,34,40,60,197,229],"solve":[3],"large":[4],"linear":[5],"systems":[6],"efficiently":[7],"has":[8],"been":[9,30],"a":[10,15,62,76,104,151,201],"key":[11],"part":[12],"of":[13,51,79,87,100,107,111,126,143,158,169],"building":[14],"successful":[16],"circuit":[17,52,128,162,172],"simulator":[18],"such":[19,44],"as":[20,200],"ones":[21],"for":[22,133,177],"power":[23,209,214],"grid":[24,210,215],"analysis.":[25],"Partition-based":[26],"iterative":[27,88],"methods":[28,45],"have":[29],"widely":[31],"adopted":[32],"due":[33],"their":[35],"divide-and-conquer":[36],"nature":[37],"and":[38,55,92,212],"amenability":[39],"parallel":[41],"implementation.":[42],"However":[43],"rely":[46],"heavily":[47],"on":[48,120,155,207],"the":[49,108,112,117,121,127,147,156,167,170,186,224],"quality":[50],"graph":[53,94,192],"partitioning,":[54],"it":[56],"is":[57,131,138,164],"extremely":[58],"challenging":[59],"develop":[61],"robust":[63],"partitioning":[64,90,163],"scheme":[65],"that":[66,218],"always":[67],"generates":[68],"near-optimal":[69],"results.":[70],"In":[71,115],"this":[72],"paper,":[73],"we":[74,149],"present":[75],"new":[77],"line":[78],"thinking":[80],"by":[81,140,166,227],"integrating":[82],"two":[83],"rather":[84],"distinct":[85],"schools":[86],"methods:":[89],"based":[91,154],"support":[93,159,191],"based.":[95],"former":[97],"enjoys":[98],"ease":[99],"parallelization,":[101],"however,":[102],"lacks":[103],"direct":[105,234],"control":[106],"numerical":[109,135,187],"properties":[110],"produced":[113],"partitions.":[114],"contrast,":[116],"latter":[118],"operates":[119],"maximum":[122],"spanning":[123],"tree":[124],"(MST)":[125],"graph,":[129,173],"which":[130],"optimized":[132],"fast":[134,179],"convergence,":[136],"but":[137],"bottlenecked":[139],"its":[141],"difficulty":[142],"parallelization.":[144],"By":[145],"combining":[146],"two,":[148],"propose":[150],"partitioning-based":[152],"preconditioner":[153,184],"theory":[157,193],"graph.":[160],"guided":[165],"MST":[168],"underlying":[171],"offering":[174],"essential":[175],"guidance":[176],"achieving":[178],"convergence.":[180],"resulting":[182],"block-Jacobi-like":[183],"maximizes":[185],"benefit":[188],"inherited":[189],"from":[190],"while":[194],"lending":[195],"itself":[196],"straightforward":[198],"parallelization":[199],"partition-based":[202],"method.":[203],"experimental":[205],"results":[206],"IBM":[208],"suite":[211],"synthetic":[213],"benchmarks":[216],"show":[217],"our":[219],"proposed":[220],"method":[221],"speeds":[222],"up":[223,228],"DC":[225],"simulation":[226],"11.5X":[230],"over":[231],"an":[232],"state-of-the-art":[233],"solver.":[235]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}