A parallel algorithm for sparse unsymmetric Lu factorization:
Abstract: "This thesis presents 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...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Urbana, Ill.
1989
|
| Schriftenreihe: | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report
907 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This thesis presents 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 Experimental comparisons on an Alliant FX/8 show that the method results in shorter elimination trees for matrices with highly asymmetrical nonzero structure than those for previous methods that work with the symmetric structure of A+A[superscript T] or A[superscript T]A (such as George and Ng's Sparspak-C or Duff and Reid's multi-frontal method). The algorithm exploits more parallelism in the pivot search phase than previous algorithms which do not force a symmetric structure onto the matrix during any phase of the factorization. Additional experimental comparisons include fillin, amount of work, numerical stability, memory usage, and run time The nondeterministic behavior of the D2 algorithm and other performance metrics are analyzed on an Alliant FX/8, a Cray-2, and a Cray-XMP/48. Enhancements to PSolve, a pairwise pivoting algorithm, are discussed, and a software tool for developing sparse matrix algorithms and observing their dynamic behavior on a Sun workstation is presented. The tool was instrumental in the development of the D2 algorithm. Possible extensions to the D2 algorithm are discussed, including the use of dense matrix kernels and replacing the synchronization structure in the pivot search with a software combining tree. |
| Beschreibung: | Zugl.: Urbana, Ill., Univ., Diss. |
| Beschreibung: | IX, 140 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008949525 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1989 m||| 00||| eng d | ||
| 035 | |a (OCoLC)21941725 | ||
| 035 | |a (DE-599)BVBBV008949525 | ||
| 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 parallel algorithm for sparse unsymmetric Lu factorization |c by Timothy Alden Davis |
| 246 | 1 | 3 | |a Reportnr. UILU ENG 89 8012 |
| 264 | 1 | |a Urbana, Ill. |c 1989 | |
| 300 | |a IX, 140 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 907 | |
| 500 | |a Zugl.: Urbana, Ill., Univ., Diss. | ||
| 520 | 3 | |a Abstract: "This thesis presents 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 | |
| 520 | 3 | |a Experimental comparisons on an Alliant FX/8 show that the method results in shorter elimination trees for matrices with highly asymmetrical nonzero structure than those for previous methods that work with the symmetric structure of A+A[superscript T] or A[superscript T]A (such as George and Ng's Sparspak-C or Duff and Reid's multi-frontal method). The algorithm exploits more parallelism in the pivot search phase than previous algorithms which do not force a symmetric structure onto the matrix during any phase of the factorization. Additional experimental comparisons include fillin, amount of work, numerical stability, memory usage, and run time | |
| 520 | 3 | |a The nondeterministic behavior of the D2 algorithm and other performance metrics are analyzed on an Alliant FX/8, a Cray-2, and a Cray-XMP/48. Enhancements to PSolve, a pairwise pivoting algorithm, are discussed, and a software tool for developing sparse matrix algorithms and observing their dynamic behavior on a Sun workstation is presented. The tool was instrumental in the development of the D2 algorithm. Possible extensions to the D2 algorithm are discussed, including the use of dense matrix kernels and replacing the synchronization structure in the pivot search with a software combining tree. | |
| 650 | 4 | |a Factorization (Mathematics) | |
| 650 | 4 | |a Matrices | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 830 | 0 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 907 |w (DE-604)BV008930033 |9 907 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005905182 | ||
Datensatz im Suchindex
| _version_ | 1804123282670092288 |
|---|---|
| any_adam_object | |
| author | Davis, Timothy A. |
| author_facet | Davis, Timothy A. |
| author_role | aut |
| author_sort | Davis, Timothy A. |
| author_variant | t a d ta tad |
| building | Verbundindex |
| bvnumber | BV008949525 |
| ctrlnum | (OCoLC)21941725 (DE-599)BVBBV008949525 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03006nam a2200373 cb4500</leader><controlfield tag="001">BV008949525</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1989 m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)21941725</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008949525</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 parallel algorithm for sparse unsymmetric Lu factorization</subfield><subfield code="c">by Timothy Alden Davis</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Reportnr. UILU ENG 89 8012</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Urbana, Ill.</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IX, 140 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">907</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Urbana, Ill., Univ., Diss.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This thesis presents 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</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Experimental comparisons on an Alliant FX/8 show that the method results in shorter elimination trees for matrices with highly asymmetrical nonzero structure than those for previous methods that work with the symmetric structure of A+A[superscript T] or A[superscript T]A (such as George and Ng's Sparspak-C or Duff and Reid's multi-frontal method). The algorithm exploits more parallelism in the pivot search phase than previous algorithms which do not force a symmetric structure onto the matrix during any phase of the factorization. Additional experimental comparisons include fillin, amount of work, numerical stability, memory usage, and run time</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The nondeterministic behavior of the D2 algorithm and other performance metrics are analyzed on an Alliant FX/8, a Cray-2, and a Cray-XMP/48. Enhancements to PSolve, a pairwise pivoting algorithm, are discussed, and a software tool for developing sparse matrix algorithms and observing their dynamic behavior on a Sun workstation is presented. The tool was instrumental in the development of the D2 algorithm. Possible extensions to the D2 algorithm are discussed, including the use of dense matrix kernels and replacing the synchronization structure in the pivot search with a software combining tree.</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="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</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">907</subfield><subfield code="w">(DE-604)BV008930033</subfield><subfield code="9">907</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005905182</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV008949525 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:18Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005905182 |
| oclc_num | 21941725 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | IX, 140 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| 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 parallel algorithm for sparse unsymmetric Lu factorization by Timothy Alden Davis Reportnr. UILU ENG 89 8012 Urbana, Ill. 1989 IX, 140 S. txt rdacontent n rdamedia nc rdacarrier Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 907 Zugl.: Urbana, Ill., Univ., Diss. Abstract: "This thesis presents 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 Experimental comparisons on an Alliant FX/8 show that the method results in shorter elimination trees for matrices with highly asymmetrical nonzero structure than those for previous methods that work with the symmetric structure of A+A[superscript T] or A[superscript T]A (such as George and Ng's Sparspak-C or Duff and Reid's multi-frontal method). The algorithm exploits more parallelism in the pivot search phase than previous algorithms which do not force a symmetric structure onto the matrix during any phase of the factorization. Additional experimental comparisons include fillin, amount of work, numerical stability, memory usage, and run time The nondeterministic behavior of the D2 algorithm and other performance metrics are analyzed on an Alliant FX/8, a Cray-2, and a Cray-XMP/48. Enhancements to PSolve, a pairwise pivoting algorithm, are discussed, and a software tool for developing sparse matrix algorithms and observing their dynamic behavior on a Sun workstation is presented. The tool was instrumental in the development of the D2 algorithm. Possible extensions to the D2 algorithm are discussed, including the use of dense matrix kernels and replacing the synchronization structure in the pivot search with a software combining tree. Factorization (Mathematics) Matrices Parallel processing (Electronic computers) (DE-588)4113937-9 Hochschulschrift gnd-content Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 907 (DE-604)BV008930033 907 |
| spellingShingle | Davis, Timothy A. A parallel algorithm for sparse unsymmetric Lu factorization Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report Factorization (Mathematics) Matrices Parallel processing (Electronic computers) |
| subject_GND | (DE-588)4113937-9 |
| title | A parallel algorithm for sparse unsymmetric Lu factorization |
| title_alt | Reportnr. UILU ENG 89 8012 |
| title_auth | A parallel algorithm for sparse unsymmetric Lu factorization |
| title_exact_search | A parallel algorithm for sparse unsymmetric Lu factorization |
| title_full | A parallel algorithm for sparse unsymmetric Lu factorization by Timothy Alden Davis |
| title_fullStr | A parallel algorithm for sparse unsymmetric Lu factorization by Timothy Alden Davis |
| title_full_unstemmed | A parallel algorithm for sparse unsymmetric Lu factorization by Timothy Alden Davis |
| title_short | A parallel algorithm for sparse unsymmetric Lu factorization |
| title_sort | a parallel algorithm for sparse unsymmetric lu factorization |
| topic | Factorization (Mathematics) Matrices Parallel processing (Electronic computers) |
| topic_facet | Factorization (Mathematics) Matrices Parallel processing (Electronic computers) Hochschulschrift |
| volume_link | (DE-604)BV008930033 |
| work_keys_str_mv | AT davistimothya aparallelalgorithmforsparseunsymmetriclufactorization AT davistimothya reportnruilueng898012 |