{"id":"https://openalex.org/W4378895322","doi":"https://doi.org/10.1145/3558481.3591315","title":"Brief Announcement: Communication Optimal Sparse LU Factorization for Planar Matrices","display_name":"Brief Announcement: Communication Optimal Sparse LU Factorization for Planar Matrices","publication_year":2023,"publication_date":"2023-05-31","ids":{"openalex":"https://openalex.org/W4378895322","doi":"https://doi.org/10.1145/3558481.3591315"},"language":"en","primary_location":{"id":"doi:10.1145/3558481.3591315","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3558481.3591315","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.osti.gov/servlets/purl/1999008","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048170299","display_name":"Piyush Sao","orcid":"https://orcid.org/0000-0002-9432-5855"},"institutions":[{"id":"https://openalex.org/I1289243028","display_name":"Oak Ridge National Laboratory","ror":"https://ror.org/01qz5mb56","country_code":"US","type":"facility","lineage":["https://openalex.org/I1289243028","https://openalex.org/I1330989302","https://openalex.org/I39565521","https://openalex.org/I4210159294"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Piyush Sao","raw_affiliation_strings":["Oak Ridge National Laboratory, Oak Ridge, TN, USA"],"raw_orcid":"https://orcid.org/0000-0002-9432-5855","affiliations":[{"raw_affiliation_string":"Oak Ridge National Laboratory, Oak Ridge, TN, USA","institution_ids":["https://openalex.org/I1289243028"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006873445","display_name":"Xiaoye Sherry Li","orcid":"https://orcid.org/0000-0002-0747-698X"},"institutions":[{"id":"https://openalex.org/I148283060","display_name":"Lawrence Berkeley National Laboratory","ror":"https://ror.org/02jbv0t02","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I148283060","https://openalex.org/I39565521"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiaoye Sherry Li","raw_affiliation_strings":["Lawrence Berkeley National Laboratory, Berkeley, CA, USA"],"raw_orcid":"https://orcid.org/0000-0002-0747-698X","affiliations":[{"raw_affiliation_string":"Lawrence Berkeley National Laboratory, Berkeley, CA, USA","institution_ids":["https://openalex.org/I148283060"]}]}],"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":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06122237,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"427","last_page":"430"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T11522","display_name":"VLSI and FPGA Design Techniques","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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9977999925613403,"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/computer-science","display_name":"Computer science","score":0.6964621543884277},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6603920459747314},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.6509712338447571},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.6305413842201233},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6145408153533936},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5386512279510498},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.49504604935646057},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.4830484986305237},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.4662116467952728},{"id":"https://openalex.org/keywords/lu-decomposition","display_name":"LU decomposition","score":0.4229659140110016},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4191233515739441},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32984796166419983}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6964621543884277},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6603920459747314},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.6509712338447571},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.6305413842201233},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6145408153533936},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5386512279510498},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.49504604935646057},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.4830484986305237},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.4662116467952728},{"id":"https://openalex.org/C123213974","wikidata":"https://www.wikidata.org/wiki/Q833089","display_name":"LU decomposition","level":4,"score":0.4229659140110016},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4191233515739441},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32984796166419983},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/3558481.3591315","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3558481.3591315","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:osti.gov:1999008","is_oa":true,"landing_page_url":"https://www.osti.gov/biblio/1999008","pdf_url":"https://www.osti.gov/servlets/purl/1999008","source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:osti.gov:1999008","is_oa":true,"landing_page_url":"https://www.osti.gov/biblio/1999008","pdf_url":"https://www.osti.gov/servlets/purl/1999008","source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7807855954","display_name":null,"funder_award_id":"ERKJ401","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"}],"funders":[{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320332359","display_name":"Office of Science","ror":"https://ror.org/00mmn6b08"},{"id":"https://openalex.org/F4320337506","display_name":"Advanced Scientific Computing Research","ror":"https://ror.org/0012c7r22"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4378895322.pdf"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W201315547","https://openalex.org/W2010747199","https://openalex.org/W2025389417","https://openalex.org/W2038643780","https://openalex.org/W2127144731","https://openalex.org/W2157237396","https://openalex.org/W2887905332","https://openalex.org/W6764276631","https://openalex.org/W6773086862"],"related_works":["https://openalex.org/W2766762530","https://openalex.org/W119752240","https://openalex.org/W2602301532","https://openalex.org/W1988437637","https://openalex.org/W2898722594","https://openalex.org/W1977700955","https://openalex.org/W2344713096","https://openalex.org/W4388311419","https://openalex.org/W2113856999","https://openalex.org/W1973739845"],"abstract_inverted_index":{"We":[0,82],"introduce":[1],"a":[2,95,108],"new":[3,61],"parallel":[4],"algorithm":[5,62,87],"for":[6,22,57,117],"solving":[7],"sparse":[8,121],"LU":[9],"factorization":[10],"of":[11,97,110],"planar":[12,120],"matrices,":[13],"which":[14],"commonly":[15],"arise":[16],"in":[17,101,113],"the":[18,30,89,102,114],"finite":[19],"element":[20],"method":[21],"2D":[23],"PDEs.":[24],"Existing":[25],"scalable":[26],"methods,":[27],"such":[28],"as":[29],"multifrontal":[31],"approach":[32],"with":[33,43],"subtree-to-subcube":[34,67],"mapping":[35,45,65,68],"by":[36,46],"Gupta":[37],"et":[38,48],"al.":[39,49],"[1]":[40],"and":[41,66,79,105],"right-looking":[42],"3D":[44,64],"Sao":[47],"[2]":[50],"fail":[51],"to":[52,69,94,107],"achieve":[53],"optimal":[54],"communication":[55,71,90],"costs":[56,72],"these":[58],"matrices.":[59],"Our":[60],"combines":[63],"minimize":[70],"while":[73],"allowing":[74],"trade-offs":[75],"between":[76],"extra":[77],"memory":[78],"reduced":[80],"communication.":[81],"demonstrate":[83],"that":[84],"our":[85],"proposed":[86],"attains":[88],"lower":[91],"bound":[92],"up":[93,106],"factor":[96,109],"O(log":[98,111],"log":[99],"n)":[100],"memory-optimal":[103],"case":[104,116],"P)":[112],"memory-independent":[115],"an":[118],"n-dimensional":[119],"matrix":[122],"on":[123],"P":[124],"processors.":[125]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}