A stable non-deterministic parallel algortihm for general unsymmetric sparse Lu factorization:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Urbana, Ill.
1990
|
| Schriftenreihe: | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report
908 |
| Schlagwörter: | |
| Abstract: | Abstract: "We present a parallel algorithm for the direct LU factorization of general unsymmetric sparse matrices. The algorithm, D2, is based on a new nondeterministic parallel pivot search that finds a compatible pivot set S of size m, followed by a parallel rank-m update. These two steps alternate until switching to dense matrix code or until the matrix is factored. The algorithm is based on a shared-memory MIMD model and takes advantage of both concurrency and (gather-scatter) vectorization. The detection of parallelism due to sparsity is based on Markowitz's strategy, an unsymmetric ordering method As a result, D2 finds more potential parallelism for matrices with highly asymmetric nonzero patterns than algorithms that construct an elimination tree using a symmetric ordering method (minimum degree or nested dissection, for example) applied to the symmetric pattern of A + A[superscript T] or A[superscript T]A. The pivot search exploits more parallelism than previous algorithms that are based on unsymmetric ordering methods. Possible extensions to the D2 algorithm are discussed, including the use of dense matrix kernels and a software combining tree to enhance parallelsim in the pivot search. |
| Umfang: | 32 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008949517 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 940206s1990 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)22145293 | ||
| 035 | |a (DE-599)BVBBV008949517 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Davis, Timothy A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A stable non-deterministic parallel algortihm for general unsymmetric sparse Lu factorization |c Timothy A. Davis and Pen-Chung Yew |
| 264 | 1 | |a Urbana, Ill. |c 1990 | |
| 300 | |a 32 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 908 | |
| 520 | 3 | |a Abstract: "We present a parallel algorithm for the direct LU factorization of general unsymmetric sparse matrices. The algorithm, D2, is based on a new nondeterministic parallel pivot search that finds a compatible pivot set S of size m, followed by a parallel rank-m update. These two steps alternate until switching to dense matrix code or until the matrix is factored. The algorithm is based on a shared-memory MIMD model and takes advantage of both concurrency and (gather-scatter) vectorization. The detection of parallelism due to sparsity is based on Markowitz's strategy, an unsymmetric ordering method | |
| 520 | 3 | |a As a result, D2 finds more potential parallelism for matrices with highly asymmetric nonzero patterns than algorithms that construct an elimination tree using a symmetric ordering method (minimum degree or nested dissection, for example) applied to the symmetric pattern of A + A[superscript T] or A[superscript T]A. The pivot search exploits more parallelism than previous algorithms that are based on unsymmetric ordering methods. Possible extensions to the D2 algorithm are discussed, including the use of dense matrix kernels and a software combining tree to enhance parallelsim in the pivot search. | |
| 650 | 4 | |a Factorization (Mathematics) | |
| 650 | 4 | |a Matrices | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 700 | 1 | |a Yew, Pen-Chung |e Verfasser |4 aut | |
| 830 | 0 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 908 |w (DE-604)BV008930033 |9 908 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-005905174 | |
Datensatz im Suchindex
| _version_ | 1818951112849358848 |
|---|---|
| any_adam_object | |
| author | Davis, Timothy A. Yew, Pen-Chung |
| author_facet | Davis, Timothy A. Yew, Pen-Chung |
| author_role | aut aut |
| author_sort | Davis, Timothy A. |
| author_variant | t a d ta tad p c y pcy |
| building | Verbundindex |
| bvnumber | BV008949517 |
| ctrlnum | (OCoLC)22145293 (DE-599)BVBBV008949517 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02365nam a2200337 cb4500</leader><controlfield tag="001">BV008949517</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940206s1990 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22145293</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008949517</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></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Davis, Timothy A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A stable non-deterministic parallel algortihm for general unsymmetric sparse Lu factorization</subfield><subfield code="c">Timothy A. Davis and Pen-Chung Yew</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Urbana, Ill.</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">32 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">Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report</subfield><subfield code="v">908</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We present a parallel algorithm for the direct LU factorization of general unsymmetric sparse matrices. The algorithm, D2, is based on a new nondeterministic parallel pivot search that finds a compatible pivot set S of size m, followed by a parallel rank-m update. These two steps alternate until switching to dense matrix code or until the matrix is factored. The algorithm is based on a shared-memory MIMD model and takes advantage of both concurrency and (gather-scatter) vectorization. The detection of parallelism due to sparsity is based on Markowitz's strategy, an unsymmetric ordering method</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">As a result, D2 finds more potential parallelism for matrices with highly asymmetric nonzero patterns than algorithms that construct an elimination tree using a symmetric ordering method (minimum degree or nested dissection, for example) applied to the symmetric pattern of A + A[superscript T] or A[superscript T]A. The pivot search exploits more parallelism than previous algorithms that are based on unsymmetric ordering methods. Possible extensions to the D2 algorithm are discussed, including the use of dense matrix kernels and a software combining tree to enhance parallelsim in the pivot search.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Factorization (Mathematics)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Matrices</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yew, Pen-Chung</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report</subfield><subfield code="v">908</subfield><subfield code="w">(DE-604)BV008930033</subfield><subfield code="9">908</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005905174</subfield></datafield></record></collection> |
| id | DE-604.BV008949517 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:29:19Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005905174 |
| oclc_num | 22145293 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 32 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |
| series2 | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |
| spelling | Davis, Timothy A. Verfasser aut A stable non-deterministic parallel algortihm for general unsymmetric sparse Lu factorization Timothy A. Davis and Pen-Chung Yew Urbana, Ill. 1990 32 S. txt rdacontent n rdamedia nc rdacarrier Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 908 Abstract: "We present a parallel algorithm for the direct LU factorization of general unsymmetric sparse matrices. The algorithm, D2, is based on a new nondeterministic parallel pivot search that finds a compatible pivot set S of size m, followed by a parallel rank-m update. These two steps alternate until switching to dense matrix code or until the matrix is factored. The algorithm is based on a shared-memory MIMD model and takes advantage of both concurrency and (gather-scatter) vectorization. The detection of parallelism due to sparsity is based on Markowitz's strategy, an unsymmetric ordering method As a result, D2 finds more potential parallelism for matrices with highly asymmetric nonzero patterns than algorithms that construct an elimination tree using a symmetric ordering method (minimum degree or nested dissection, for example) applied to the symmetric pattern of A + A[superscript T] or A[superscript T]A. The pivot search exploits more parallelism than previous algorithms that are based on unsymmetric ordering methods. Possible extensions to the D2 algorithm are discussed, including the use of dense matrix kernels and a software combining tree to enhance parallelsim in the pivot search. Factorization (Mathematics) Matrices Parallel processing (Electronic computers) Yew, Pen-Chung Verfasser aut Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 908 (DE-604)BV008930033 908 |
| spellingShingle | Davis, Timothy A. Yew, Pen-Chung A stable non-deterministic parallel algortihm for general unsymmetric sparse Lu factorization Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report Factorization (Mathematics) Matrices Parallel processing (Electronic computers) |
| title | A stable non-deterministic parallel algortihm for general unsymmetric sparse Lu factorization |
| title_auth | A stable non-deterministic parallel algortihm for general unsymmetric sparse Lu factorization |
| title_exact_search | A stable non-deterministic parallel algortihm for general unsymmetric sparse Lu factorization |
| title_full | A stable non-deterministic parallel algortihm for general unsymmetric sparse Lu factorization Timothy A. Davis and Pen-Chung Yew |
| title_fullStr | A stable non-deterministic parallel algortihm for general unsymmetric sparse Lu factorization Timothy A. Davis and Pen-Chung Yew |
| title_full_unstemmed | A stable non-deterministic parallel algortihm for general unsymmetric sparse Lu factorization Timothy A. Davis and Pen-Chung Yew |
| title_short | A stable non-deterministic parallel algortihm for general unsymmetric sparse Lu factorization |
| title_sort | a stable non deterministic parallel algortihm for general unsymmetric sparse lu factorization |
| topic | Factorization (Mathematics) Matrices Parallel processing (Electronic computers) |
| topic_facet | Factorization (Mathematics) Matrices Parallel processing (Electronic computers) |
| volume_link | (DE-604)BV008930033 |
| work_keys_str_mv | AT davistimothya astablenondeterministicparallelalgortihmforgeneralunsymmetricsparselufactorization AT yewpenchung astablenondeterministicparallelalgortihmforgeneralunsymmetricsparselufactorization |