{"id":"https://openalex.org/W2142514638","doi":"https://doi.org/10.1145/1687399.1687477","title":"A parallel preconditioning strategy for efficient transistor-level circuit simulation","display_name":"A parallel preconditioning strategy for efficient transistor-level circuit simulation","publication_year":2009,"publication_date":"2009-11-02","ids":{"openalex":"https://openalex.org/W2142514638","doi":"https://doi.org/10.1145/1687399.1687477","mag":"2142514638"},"language":"en","primary_location":{"id":"doi:10.1145/1687399.1687477","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1687399.1687477","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 International Conference on Computer-Aided Design","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/A5081841433","display_name":"Heidi Thornquist","orcid":null},"institutions":[{"id":"https://openalex.org/I4210104735","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Heidi K. Thornquist","raw_affiliation_strings":["Sandia National Laboratories, Albuquerque, NM"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sandia National Laboratories, Albuquerque, NM","institution_ids":["https://openalex.org/I4210104735"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052286536","display_name":"Eric Keiter","orcid":"https://orcid.org/0000-0001-6673-8727"},"institutions":[{"id":"https://openalex.org/I4210104735","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eric R. Keiter","raw_affiliation_strings":["Sandia National Laboratories, Albuquerque, NM"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sandia National Laboratories, Albuquerque, NM","institution_ids":["https://openalex.org/I4210104735"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005253690","display_name":"Robert J. Hoekstra","orcid":null},"institutions":[{"id":"https://openalex.org/I4210104735","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert J. Hoekstra","raw_affiliation_strings":["Sandia National Laboratories, Albuquerque, NM"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sandia National Laboratories, Albuquerque, NM","institution_ids":["https://openalex.org/I4210104735"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109329785","display_name":"David Day","orcid":null},"institutions":[{"id":"https://openalex.org/I4210104735","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David M. Day","raw_affiliation_strings":["Sandia National Laboratories, Albuquerque, NM"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sandia National Laboratories, Albuquerque, NM","institution_ids":["https://openalex.org/I4210104735"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042681205","display_name":"Erik G. Boman","orcid":"https://orcid.org/0000-0003-2216-5546"},"institutions":[{"id":"https://openalex.org/I4210104735","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Erik G. Boman","raw_affiliation_strings":["Sandia National Laboratories, Albuquerque, NM"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sandia National Laboratories, Albuquerque, NM","institution_ids":["https://openalex.org/I4210104735"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210104735"],"apc_list":null,"apc_paid":null,"fwci":7.7667,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.98312259,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"410","last_page":"417"},"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.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"}},"topics":[{"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"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9990000128746033,"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/solver","display_name":"Solver","score":0.8405383825302124},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.8208428025245667},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7890961170196533},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6783313155174255},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5221981406211853},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.4632047414779663},{"id":"https://openalex.org/keywords/computational-science","display_name":"Computational science","score":0.41826826333999634},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.41694480180740356},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.307712197303772},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11749821901321411}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.8405383825302124},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.8208428025245667},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7890961170196533},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6783313155174255},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5221981406211853},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4632047414779663},{"id":"https://openalex.org/C459310","wikidata":"https://www.wikidata.org/wiki/Q117801","display_name":"Computational science","level":1,"score":0.41826826333999634},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.41694480180740356},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.307712197303772},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11749821901321411},{"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/1687399.1687477","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1687399.1687477","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 International Conference on Computer-Aided Design","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":38,"referenced_works":["https://openalex.org/W1499138327","https://openalex.org/W1506342804","https://openalex.org/W1509997287","https://openalex.org/W1520511539","https://openalex.org/W1580993858","https://openalex.org/W1945186739","https://openalex.org/W2003105834","https://openalex.org/W2005992599","https://openalex.org/W2006562083","https://openalex.org/W2014730252","https://openalex.org/W2022916138","https://openalex.org/W2029644687","https://openalex.org/W2030651811","https://openalex.org/W2036597275","https://openalex.org/W2078174680","https://openalex.org/W2081612620","https://openalex.org/W2082801772","https://openalex.org/W2085602449","https://openalex.org/W2086171891","https://openalex.org/W2098234232","https://openalex.org/W2109139651","https://openalex.org/W2115314588","https://openalex.org/W2118953734","https://openalex.org/W2127927798","https://openalex.org/W2141331848","https://openalex.org/W2142184646","https://openalex.org/W2143135486","https://openalex.org/W2161455936","https://openalex.org/W2162785126","https://openalex.org/W2167078995","https://openalex.org/W2484118837","https://openalex.org/W3139794248","https://openalex.org/W3140592728","https://openalex.org/W3202477519","https://openalex.org/W4206557440","https://openalex.org/W4213104200","https://openalex.org/W6630321834","https://openalex.org/W6652022480"],"related_works":["https://openalex.org/W1604758548","https://openalex.org/W4367553810","https://openalex.org/W2104142636","https://openalex.org/W1549048322","https://openalex.org/W2804126825","https://openalex.org/W2011940952","https://openalex.org/W2731831065","https://openalex.org/W4283162424","https://openalex.org/W2607998022","https://openalex.org/W2059382600"],"abstract_inverted_index":{"We":[0,103],"describe":[1],"a":[2,15,44,54,59,111,115,125],"parallel":[3,20,49,61,81,97,108,116],"computing":[4],"approach":[5],"for":[6,18,63,79,84],"large-scale":[7],"SPICE-accurate":[8],"circuit":[9,25,73,128],"simulation,":[10],"which":[11],"is":[12],"based":[13],"on":[14,70,124],"new":[16,107],"strategy":[17,28],"the":[19,64,85],"preconditioned":[21],"iterative":[22,122],"solution":[23],"of":[24,30,53,87,127],"matrices.":[26],"This":[27],"consists":[29],"several":[31],"steps,":[32],"including":[33],"singleton":[34],"removal,":[35],"block":[36,45],"triangular":[37],"form":[38],"(BTF)":[39],"reordering,":[40],"hypergraph":[41],"partitioning,":[42],"and":[43,67,119],"Jacobi":[46],"pre-conditioner.":[47],"Our":[48],"implementation":[50],"makes":[51],"use":[52],"mixed":[55],"load":[56,66],"balance,":[57],"employing":[58],"different":[60],"partition":[62],"matrix":[65],"solve.":[68],"Based":[69],"message-passing,":[71],"our":[72,106],"simulation":[74],"code":[75],"was":[76],"originally":[77],"designed":[78],"large":[80],"computers,":[82],"but":[83],"purposes":[86],"this":[88],"paper":[89],"we":[90],"demonstrate":[91],"that":[92,105],"it":[93],"also":[94],"gives":[95],"good":[96],"speedup":[98],"in":[99],"modern":[100],"multi-core":[101],"environments.":[102],"show":[104],"solver":[109,118,123],"outperforms":[110],"serial":[112],"direct":[113,117],"solver,":[114],"an":[120],"alternative":[121],"set":[126],"test":[129],"problems.":[130]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":6}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}