{"id":"https://openalex.org/W192530659","doi":null,"title":"A partitioning strategy for parallel sparse Cholesky factorization","display_name":"A partitioning strategy for parallel sparse Cholesky factorization","alternate_titles":[],"publication_year":1988,"publication_date":"1988-11-01","ids":{"openalex":"https://openalex.org/W192530659","mag":"192530659"},"language":"en","primary_location":{"id":"mag:192530659","doi":null,"is_oa":false,"landing_page_url":"http://www.osti.gov/scitech/biblio/6547279-partitioning-strategy-parallel-sparse-cholesky-factorization","pdf_url":null,"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,"listed_in":[],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W192530659"],"child_works_count":0,"type":"report","is_traditional":false,"indexed_in":[],"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/A5111726096","display_name":"George A. Geist","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G.A. Geist","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5056131016","display_name":"Esmond Ng","orcid":"https://orcid.org/0000-0002-4535-6348","observed_orcids":["https://orcid.org/0000-0002-4535-6348"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Esmond Ng","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-4535-6348","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.926800012588501,"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"}},"topics":[{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.926800012588501,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.07029999792575836,"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/T10339","display_name":"Advanced Numerical Methods in Computational Mathematics","score":0.0003000000142492354,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sparse-cholesky-factorization","display_name":"sparse Cholesky factorization","score":0.9319999814033508},{"id":"https://openalex.org/keywords/task-decomposition","display_name":"task decomposition","score":0.6629999876022339},{"id":"https://openalex.org/keywords/load-balancing","display_name":"load balancing","score":0.9279999732971191},{"id":"https://openalex.org/keywords/elimination-tree","display_name":"elimination tree","score":0.9070000052452087},{"id":"https://openalex.org/keywords/task-allocation","display_name":"task allocation","score":0.7239999771118164},{"id":"https://openalex.org/keywords/minimum-degree-ordering","display_name":"minimum degree ordering","score":0.902999997138977},{"id":"https://openalex.org/keywords/nested-dissection","display_name":"nested dissection","score":0.9959999918937683},{"id":"https://openalex.org/keywords/processor-communication","display_name":"processor communication","score":0.5249999761581421},{"id":"https://openalex.org/keywords/intel-ipsc-2","display_name":"Intel iPSC/2","score":0.9350000023841858}],"concepts":[{"id":"https://openalex.org/C46085209","wikidata":"https://www.wikidata.org/wiki/Q17098969","display_name":"Minimum degree algorithm","level":5,"score":0.8367565870285034},{"id":"https://openalex.org/C34727166","wikidata":"https://www.wikidata.org/wiki/Q515375","display_name":"Cholesky decomposition","level":3,"score":0.8149114847183228},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7627182602882385},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6757165193557739},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.6045361757278442},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.5724256634712219},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5484283566474915},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.49770310521125793},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4972896873950958},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.41867557168006897},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37314701080322266},{"id":"https://openalex.org/C44363057","wikidata":"https://www.wikidata.org/wiki/Q6015160","display_name":"Incomplete Cholesky factorization","level":4,"score":0.33517104387283325},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3272438645362854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21834120154380798},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.17759251594543457},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1258586347103119},{"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","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/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:192530659","doi":null,"is_oa":false,"landing_page_url":"http://www.osti.gov/scitech/biblio/6547279-partitioning-strategy-parallel-sparse-cholesky-factorization","pdf_url":null,"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,"listed_in":[],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1992935334","https://openalex.org/W232494833","https://openalex.org/W2103536620","https://openalex.org/W1540154732","https://openalex.org/W1968235986","https://openalex.org/W2105394178","https://openalex.org/W2024304812","https://openalex.org/W1438229281","https://openalex.org/W1993166013","https://openalex.org/W7100619651"],"abstract_inverted_index":{"This":[0,73],"paper":[1],"presents":[2],"a":[3,17,32,62],"solution":[4],"to":[5,27,69],"the":[6,10,38,42,55,58,83,94],"problem":[7],"of":[8,22,35,44,57],"partitioning":[9,24],"work":[11],"for":[12,61,99],"sparse":[13],"matrix":[14],"factorization":[15],"on":[16,54],"multiprocessor":[18],"system.":[19],"The":[20,48],"goal":[21],"this":[23],"strategy":[25,51],"is":[26,52,74],"achieve":[28],"load":[29],"balancing":[30],"and":[31,65,107],"high":[33],"degree":[34,85,109],"concurrency":[36],"among":[37],"processors":[39],"while":[40],"reducing":[41],"amount":[43],"processor-to-processor":[45],"data":[46],"communication.":[47],"task":[49],"assignment":[50],"based":[53],"structure":[56],"elimination":[59,90],"tree":[60],"given":[63],"ordering,":[64],"can":[66],"be":[67],"applied":[68],"arbitrarily":[70],"unbalanced":[71,89],"trees.":[72,91],"important":[75],"because":[76],"popular":[77],"fill-reducing":[78],"ordering":[79],"methods,":[80],"such":[81],"as":[82],"minimum":[84,108],"algorithm,":[86],"often":[87],"produce":[88],"Results":[92],"from":[93],"Intel":[95],"iPSC/2":[96],"are":[97],"presented":[98],"various":[100],"finite-element":[101],"problems":[102],"using":[103],"both":[104],"nested":[105],"dissection":[106],"orderings":[110],"14":[111],"refs.,":[112],"12":[113],"figs.,":[114],"6":[115],"tabs.":[116]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W192530659","counts_by_year":[],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
