{"id":"https://openalex.org/W2021413160","doi":"https://doi.org/10.1016/s0167-8191(99)00027-7","title":"Minimum communication cost reordering for parallel sparse Cholesky factorization","display_name":"Minimum communication cost reordering for parallel sparse Cholesky factorization","publication_year":1999,"publication_date":"1999-09-01","ids":{"openalex":"https://openalex.org/W2021413160","doi":"https://doi.org/10.1016/s0167-8191(99)00027-7","mag":"2021413160"},"language":"en","primary_location":{"id":"doi:10.1016/s0167-8191(99)00027-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-8191(99)00027-7","pdf_url":null,"source":{"id":"https://openalex.org/S112708030","display_name":"Parallel Computing","issn_l":"0167-8191","issn":["0167-8191","1872-7336"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Computing","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/A5032504698","display_name":"Wen-Yang Lin","orcid":"https://orcid.org/0000-0003-3462-7744"},"institutions":[{"id":"https://openalex.org/I98298690","display_name":"I-Shou University","ror":"https://ror.org/04d7e4m76","country_code":"TW","type":"education","lineage":["https://openalex.org/I98298690"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Wen-Yang Lin","raw_affiliation_strings":["Department of Information Management, I-Shou University, Kaohsiung, Taiwan, ROC","Department of Information Management, I-Shou University, Kaohsiung, Taiwan, ROC#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Information Management, I-Shou University, Kaohsiung, Taiwan, ROC","institution_ids":["https://openalex.org/I98298690"]},{"raw_affiliation_string":"Department of Information Management, I-Shou University, Kaohsiung, Taiwan, ROC#TAB#","institution_ids":["https://openalex.org/I98298690"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061876684","display_name":"Chuen-Liang Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chuen-Liang Chen","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, ROC","Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan,ROC"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, ROC","institution_ids":["https://openalex.org/I16733864"]},{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan,ROC","institution_ids":["https://openalex.org/I16733864"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032504698"],"corresponding_institution_ids":["https://openalex.org/I98298690"],"apc_list":{"value":2680,"currency":"USD","value_usd":2680},"apc_paid":null,"fwci":0.8096,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.79486504,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"25","issue":"8","first_page":"943","last_page":"967"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"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/cholesky-decomposition","display_name":"Cholesky decomposition","score":0.9303988218307495},{"id":"https://openalex.org/keywords/incomplete-cholesky-factorization","display_name":"Incomplete Cholesky factorization","score":0.7360818386077881},{"id":"https://openalex.org/keywords/minimum-degree-algorithm","display_name":"Minimum degree algorithm","score":0.6903864145278931},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6122247576713562},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5782400369644165},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.5648934841156006},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5525359511375427},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.5252109169960022},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.499722957611084},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44526687264442444},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.41353175044059753},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3631344139575958},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26855403184890747},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2296789288520813}],"concepts":[{"id":"https://openalex.org/C34727166","wikidata":"https://www.wikidata.org/wiki/Q515375","display_name":"Cholesky decomposition","level":3,"score":0.9303988218307495},{"id":"https://openalex.org/C44363057","wikidata":"https://www.wikidata.org/wiki/Q6015160","display_name":"Incomplete Cholesky factorization","level":4,"score":0.7360818386077881},{"id":"https://openalex.org/C46085209","wikidata":"https://www.wikidata.org/wiki/Q17098969","display_name":"Minimum degree algorithm","level":5,"score":0.6903864145278931},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6122247576713562},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5782400369644165},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.5648934841156006},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5525359511375427},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.5252109169960022},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.499722957611084},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44526687264442444},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.41353175044059753},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3631344139575958},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26855403184890747},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2296789288520813},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0167-8191(99)00027-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-8191(99)00027-7","pdf_url":null,"source":{"id":"https://openalex.org/S112708030","display_name":"Parallel Computing","issn_l":"0167-8191","issn":["0167-8191","1872-7336"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W147544441","https://openalex.org/W594514321","https://openalex.org/W1510015875","https://openalex.org/W1554451661","https://openalex.org/W1980946208","https://openalex.org/W1981885118","https://openalex.org/W1993274656","https://openalex.org/W2007903522","https://openalex.org/W2025695688","https://openalex.org/W2037106315","https://openalex.org/W2043616552","https://openalex.org/W2051800546","https://openalex.org/W2059098138","https://openalex.org/W2086648616","https://openalex.org/W2089898547","https://openalex.org/W2096559782","https://openalex.org/W2122253960","https://openalex.org/W2125720043","https://openalex.org/W2143474538","https://openalex.org/W2152320213","https://openalex.org/W6678762054"],"related_works":["https://openalex.org/W898189783","https://openalex.org/W2381435995","https://openalex.org/W2104481679","https://openalex.org/W2113085198","https://openalex.org/W2041033288","https://openalex.org/W3022256543","https://openalex.org/W2028693659","https://openalex.org/W3046276560","https://openalex.org/W2053627399","https://openalex.org/W2078637543"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}