{"id":"https://openalex.org/W2093056394","doi":"https://doi.org/10.1142/s012905339900003x","title":"SCALABILITY OF SPARSE CHOLESKY FACTORIZATION","display_name":"SCALABILITY OF SPARSE CHOLESKY FACTORIZATION","publication_year":1999,"publication_date":"1999-03-01","ids":{"openalex":"https://openalex.org/W2093056394","doi":"https://doi.org/10.1142/s012905339900003x","mag":"2093056394"},"language":"en","primary_location":{"id":"doi:10.1142/s012905339900003x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905339900003x","pdf_url":null,"source":{"id":"https://openalex.org/S112418432","display_name":"International Journal of High Speed Computing","issn_l":"0129-0533","issn":["0129-0533"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of High Speed 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/A5080647016","display_name":"Thomas Rauber","orcid":"https://orcid.org/0000-0002-3102-6858"},"institutions":[{"id":"https://openalex.org/I68956291","display_name":"Martin Luther University Halle-Wittenberg","ror":"https://ror.org/05gqaka33","country_code":"DE","type":"education","lineage":["https://openalex.org/I68956291"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"THOMAS RAUBER","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Halle-Wittenberg, Kurt-Mothes-Str.1, 06120 Halle (Saale), Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Halle-Wittenberg, Kurt-Mothes-Str.1, 06120 Halle (Saale), Germany","institution_ids":["https://openalex.org/I68956291"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017610430","display_name":"Gudula R\u00fcnger","orcid":"https://orcid.org/0000-0002-5364-2088"},"institutions":[{"id":"https://openalex.org/I926574661","display_name":"Leipzig University","ror":"https://ror.org/03s7gtk40","country_code":"DE","type":"education","lineage":["https://openalex.org/I926574661"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"GUDULA R\u00dcNGER","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Leipzig, Postfach 920, 04009 Leipzig, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Leipzig, Postfach 920, 04009 Leipzig, Germany","institution_ids":["https://openalex.org/I926574661"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037495725","display_name":"Carsten Scholtes","orcid":null},"institutions":[{"id":"https://openalex.org/I68956291","display_name":"Martin Luther University Halle-Wittenberg","ror":"https://ror.org/05gqaka33","country_code":"DE","type":"education","lineage":["https://openalex.org/I68956291"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"CARSTEN SCHOLTES","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Halle-Wittenberg, Kurt-Mothes-Str.1, 06120 Halle (Saale), Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Halle-Wittenberg, Kurt-Mothes-Str.1, 06120 Halle (Saale), Germany","institution_ids":["https://openalex.org/I68956291"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5080647016"],"corresponding_institution_ids":["https://openalex.org/I68956291"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.16488277,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"10","issue":"01","first_page":"19","last_page":"52"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9988999962806702,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.998199999332428,"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.895825982093811},{"id":"https://openalex.org/keywords/cholesky-decomposition","display_name":"Cholesky decomposition","score":0.8789717555046082},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7922384738922119},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7162944078445435},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.5424720644950867},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5166707038879395},{"id":"https://openalex.org/keywords/minimum-degree-algorithm","display_name":"Minimum degree algorithm","score":0.5146359205245972},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5113345980644226},{"id":"https://openalex.org/keywords/distributed-memory","display_name":"Distributed memory","score":0.4821024239063263},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.47961175441741943},{"id":"https://openalex.org/keywords/incomplete-cholesky-factorization","display_name":"Incomplete Cholesky factorization","score":0.3591305911540985},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07734763622283936},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07267087697982788},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07137024402618408}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.895825982093811},{"id":"https://openalex.org/C34727166","wikidata":"https://www.wikidata.org/wiki/Q515375","display_name":"Cholesky decomposition","level":3,"score":0.8789717555046082},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7922384738922119},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7162944078445435},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.5424720644950867},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5166707038879395},{"id":"https://openalex.org/C46085209","wikidata":"https://www.wikidata.org/wiki/Q17098969","display_name":"Minimum degree algorithm","level":5,"score":0.5146359205245972},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5113345980644226},{"id":"https://openalex.org/C91481028","wikidata":"https://www.wikidata.org/wiki/Q1054686","display_name":"Distributed memory","level":3,"score":0.4821024239063263},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.47961175441741943},{"id":"https://openalex.org/C44363057","wikidata":"https://www.wikidata.org/wiki/Q6015160","display_name":"Incomplete Cholesky factorization","level":4,"score":0.3591305911540985},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07734763622283936},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07267087697982788},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07137024402618408},{"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/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s012905339900003x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905339900003x","pdf_url":null,"source":{"id":"https://openalex.org/S112418432","display_name":"International Journal of High Speed Computing","issn_l":"0129-0533","issn":["0129-0533"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of High Speed Computing","raw_type":"journal-article"},{"id":"pmh:oai::25402","is_oa":false,"landing_page_url":"https://eref.uni-bayreuth.de/25402/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196442","display_name":"ERef Bayreuth (University of Bayreuth)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I54009628","host_organization_name":"University of Bayreuth","host_organization_lineage":["https://openalex.org/I54009628"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Artikel in einer Zeitschrift"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W147544441","https://openalex.org/W165961388","https://openalex.org/W334467234","https://openalex.org/W1613336034","https://openalex.org/W1693881312","https://openalex.org/W1767223598","https://openalex.org/W1966285605","https://openalex.org/W1971947347","https://openalex.org/W1975124102","https://openalex.org/W1980946208","https://openalex.org/W1986894511","https://openalex.org/W1993274656","https://openalex.org/W2022842990","https://openalex.org/W2027566319","https://openalex.org/W2027995390","https://openalex.org/W2043839703","https://openalex.org/W2051086725","https://openalex.org/W2054557822","https://openalex.org/W2068306188","https://openalex.org/W2073620958","https://openalex.org/W2077309453","https://openalex.org/W2092629477","https://openalex.org/W2098761003","https://openalex.org/W2124431105","https://openalex.org/W2131886407","https://openalex.org/W2151731617","https://openalex.org/W2153752008","https://openalex.org/W2160454978","https://openalex.org/W2165608046","https://openalex.org/W3004728147","https://openalex.org/W3140459679","https://openalex.org/W3144737817","https://openalex.org/W4249058798"],"related_works":["https://openalex.org/W2039814159","https://openalex.org/W898189783","https://openalex.org/W2049943687","https://openalex.org/W2381435995","https://openalex.org/W2104481679","https://openalex.org/W2041033288","https://openalex.org/W3046276560","https://openalex.org/W2028693659","https://openalex.org/W2053627399","https://openalex.org/W2079508979"],"abstract_inverted_index":{"A":[0],"variety":[1],"of":[2,22,25,42,50,65,99,120,134,154],"algorithms":[3,27,145,158],"have":[4],"been":[5],"proposed":[6],"for":[7,61,107,127,131,150,161],"sparse":[8],"Cholesky":[9],"factorization,":[10],"including":[11],"left-looking,":[12],"right-looking,":[13],"and":[14,46],"supernodal":[15],"algorithms.":[16,53],"This":[17,82],"article":[18,83],"investigates":[19],"shared-memory":[20,75],"implementations":[21],"several":[23],"variants":[24],"these":[26],"in":[28,57,91],"a":[29,74,88,108,151],"task-oriented":[30],"execution":[31,68],"model":[32],"with":[33,77],"dynamic":[34],"scheduling.":[35],"In":[36],"particular,":[37],"we":[38,70,93,102],"consider":[39],"the":[40,44,47,51,58,72,97,118,129,132,147],"degree":[41],"parallelism,":[43],"scalability,":[45],"scheduling":[48],"overhead":[49,130],"different":[52],"Our":[54],"emphasis":[55],"lies":[56],"parallel":[59],"implementation":[60],"relatively":[62],"large":[63],"numbers":[64],"processors.":[66,81,163],"As":[67],"platform,":[69],"use":[71],"SB-PRAM,":[73],"machine":[76,115],"up":[78],"to":[79,95,105],"2048":[80],"can":[84,103,123],"be":[85,124],"considered":[86],"as":[87],"case":[89],"study":[90],"which":[92,100,117,128],"try":[94],"answer":[96],"question":[98],"performance":[101],"hope":[104],"get":[106],"typical":[109],"irregular":[110],"application":[111],"on":[112,116],"an":[113],"ideal":[114],"locality":[119],"memory":[121],"accesses":[122],"ignored":[125],"but":[126],"management":[133],"data":[135],"structures":[136],"still":[137],"takes":[138],"effect.":[139],"The":[140],"investigation":[141],"shows":[142],"that":[143],"certain":[144],"are":[146,159],"best":[148],"choice":[149],"small":[152],"number":[153],"processors,":[155],"while":[156],"other":[157],"better":[160],"many":[162]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}