An efficient block-oriented approach to parallel sparse Cholesky-factorization:
Abstract: "This paper explores the use of a sub-block decomposition strategy for parallel sparse Cholesky factorization, in which the sparse matrix is decomposed into rectangular blocks. Such a strategy has enormous theoretical scalability advantages over a more traditional column-oriented deco...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Stanford, Calif.
1992
|
| Series: | Stanford University / Computer Science Department: Report STAN CS
1438 |
| Subjects: | |
| Summary: | Abstract: "This paper explores the use of a sub-block decomposition strategy for parallel sparse Cholesky factorization, in which the sparse matrix is decomposed into rectangular blocks. Such a strategy has enormous theoretical scalability advantages over a more traditional column-oriented decomposition for large parallel machines. However, little progress has been made in producing a practical sub-block method. This paper describes and evaluates an approach that is both simple and efficient." |
| Physical Description: | 25 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009033900 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940227s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)27409149 | ||
| 035 | |a (DE-599)BVBBV009033900 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 100 | 1 | |a Rothberg, Edward |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a An efficient block-oriented approach to parallel sparse Cholesky-factorization |c Edward Rothberg and Anoop Gupta |
| 246 | 1 | 3 | |a Reportnr. CSL TR 92 533 |
| 264 | 1 | |a Stanford, Calif. |c 1992 | |
| 300 | |a 25 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN CS |v 1438 | |
| 520 | 3 | |a Abstract: "This paper explores the use of a sub-block decomposition strategy for parallel sparse Cholesky factorization, in which the sparse matrix is decomposed into rectangular blocks. Such a strategy has enormous theoretical scalability advantages over a more traditional column-oriented decomposition for large parallel machines. However, little progress has been made in producing a practical sub-block method. This paper describes and evaluates an approach that is both simple and efficient." | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 650 | 4 | |a Sparse matrices | |
| 700 | 1 | |a Gupta, Anoop |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1438 |w (DE-604)BV008928280 |9 1438 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005976674 | ||
Record in the Search Index
| _version_ | 1804123387394523136 |
|---|---|
| any_adam_object | |
| author | Rothberg, Edward Gupta, Anoop |
| author_facet | Rothberg, Edward Gupta, Anoop |
| author_role | aut aut |
| author_sort | Rothberg, Edward |
| author_variant | e r er a g ag |
| building | Verbundindex |
| bvnumber | BV009033900 |
| ctrlnum | (OCoLC)27409149 (DE-599)BVBBV009033900 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01606nam a2200325 cb4500</leader><controlfield tag="001">BV009033900</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27409149</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009033900</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rothberg, Edward</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An efficient block-oriented approach to parallel sparse Cholesky-factorization</subfield><subfield code="c">Edward Rothberg and Anoop Gupta</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Reportnr. CSL TR 92 533</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">25 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Stanford University / Computer Science Department: Report STAN CS</subfield><subfield code="v">1438</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper explores the use of a sub-block decomposition strategy for parallel sparse Cholesky factorization, in which the sparse matrix is decomposed into rectangular blocks. Such a strategy has enormous theoretical scalability advantages over a more traditional column-oriented decomposition for large parallel machines. However, little progress has been made in producing a practical sub-block method. This paper describes and evaluates an approach that is both simple and efficient."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sparse matrices</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gupta, Anoop</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1438</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1438</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005976674</subfield></datafield></record></collection> |
| id | DE-604.BV009033900 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:58Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005976674 |
| oclc_num | 27409149 |
| open_access_boolean | |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 25 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spelling | Rothberg, Edward Verfasser aut An efficient block-oriented approach to parallel sparse Cholesky-factorization Edward Rothberg and Anoop Gupta Reportnr. CSL TR 92 533 Stanford, Calif. 1992 25 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN CS 1438 Abstract: "This paper explores the use of a sub-block decomposition strategy for parallel sparse Cholesky factorization, in which the sparse matrix is decomposed into rectangular blocks. Such a strategy has enormous theoretical scalability advantages over a more traditional column-oriented decomposition for large parallel machines. However, little progress has been made in producing a practical sub-block method. This paper describes and evaluates an approach that is both simple and efficient." Parallel processing (Electronic computers) Sparse matrices Gupta, Anoop Verfasser aut Computer Science Department: Report STAN CS Stanford University 1438 (DE-604)BV008928280 1438 |
| spellingShingle | Rothberg, Edward Gupta, Anoop An efficient block-oriented approach to parallel sparse Cholesky-factorization Parallel processing (Electronic computers) Sparse matrices |
| title | An efficient block-oriented approach to parallel sparse Cholesky-factorization |
| title_alt | Reportnr. CSL TR 92 533 |
| title_auth | An efficient block-oriented approach to parallel sparse Cholesky-factorization |
| title_exact_search | An efficient block-oriented approach to parallel sparse Cholesky-factorization |
| title_full | An efficient block-oriented approach to parallel sparse Cholesky-factorization Edward Rothberg and Anoop Gupta |
| title_fullStr | An efficient block-oriented approach to parallel sparse Cholesky-factorization Edward Rothberg and Anoop Gupta |
| title_full_unstemmed | An efficient block-oriented approach to parallel sparse Cholesky-factorization Edward Rothberg and Anoop Gupta |
| title_short | An efficient block-oriented approach to parallel sparse Cholesky-factorization |
| title_sort | an efficient block oriented approach to parallel sparse cholesky factorization |
| topic | Parallel processing (Electronic computers) Sparse matrices |
| topic_facet | Parallel processing (Electronic computers) Sparse matrices |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT rothbergedward anefficientblockorientedapproachtoparallelsparsecholeskyfactorization AT guptaanoop anefficientblockorientedapproachtoparallelsparsecholeskyfactorization AT rothbergedward reportnrcsltr92533 AT guptaanoop reportnrcsltr92533 |