Block-Cholesky for parallel processing:
Abstract: "We concentrate on the Cholesky factorization of A=L L[superscript T], where A is a positive definite symmetric matrix and L is a lower triangular matrix. A blocked algorithm based on Level 3 BLAS is discussed. When using Level 3 BLAS kernels in a multiprocessing mode, one can paralle...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Amsterdam
1990
|
Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Numerieke Wiskunde: Report NM
1990,23 |
Schlagworte: | |
Zusammenfassung: | Abstract: "We concentrate on the Cholesky factorization of A=L L[superscript T], where A is a positive definite symmetric matrix and L is a lower triangular matrix. A blocked algorithm based on Level 3 BLAS is discussed. When using Level 3 BLAS kernels in a multiprocessing mode, one can parallelize within each kernel, or can obtain parallelism by performing different matrix-matrix operations on different processors. We apply parallelism over the blocks. We study the amount of parallelism and we discuss the data dependency graph. The SCHEDULE package is used to obtain a portable scheduling of the tasks. Numerical results of our method are presented and compared with the results for a block algorithm parallelized within the Level 3 BLAS kernels." |
Beschreibung: | 20 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV010192576 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 950523s1990 |||| 00||| engod | ||
035 | |a (OCoLC)24807100 | ||
035 | |a (DE-599)BVBBV010192576 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-91G | ||
100 | 1 | |a Louter-Nool, Margreet |e Verfasser |4 aut | |
245 | 1 | 0 | |a Block-Cholesky for parallel processing |c M. Louter-Nool |
264 | 1 | |a Amsterdam |c 1990 | |
300 | |a 20 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Numerieke Wiskunde: Report NM |v 1990,23 | |
520 | 3 | |a Abstract: "We concentrate on the Cholesky factorization of A=L L[superscript T], where A is a positive definite symmetric matrix and L is a lower triangular matrix. A blocked algorithm based on Level 3 BLAS is discussed. When using Level 3 BLAS kernels in a multiprocessing mode, one can parallelize within each kernel, or can obtain parallelism by performing different matrix-matrix operations on different processors. We apply parallelism over the blocks. We study the amount of parallelism and we discuss the data dependency graph. The SCHEDULE package is used to obtain a portable scheduling of the tasks. Numerical results of our method are presented and compared with the results for a block algorithm parallelized within the Level 3 BLAS kernels." | |
650 | 4 | |a Parallel processing (Electronic computers) | |
650 | 4 | |a Production scheduling | |
810 | 2 | |a Afdeling Numerieke Wiskunde: Report NM |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 1990,23 |w (DE-604)BV010177152 |9 1990,23 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006772569 |
Datensatz im Suchindex
_version_ | 1804124596067106816 |
---|---|
any_adam_object | |
author | Louter-Nool, Margreet |
author_facet | Louter-Nool, Margreet |
author_role | aut |
author_sort | Louter-Nool, Margreet |
author_variant | m l n mln |
building | Verbundindex |
bvnumber | BV010192576 |
ctrlnum | (OCoLC)24807100 (DE-599)BVBBV010192576 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01765nam a2200301 cb4500</leader><controlfield tag="001">BV010192576</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950523s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24807100</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010192576</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-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Louter-Nool, Margreet</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Block-Cholesky for parallel processing</subfield><subfield code="c">M. Louter-Nool</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20 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">Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Numerieke Wiskunde: Report NM</subfield><subfield code="v">1990,23</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We concentrate on the Cholesky factorization of A=L L[superscript T], where A is a positive definite symmetric matrix and L is a lower triangular matrix. A blocked algorithm based on Level 3 BLAS is discussed. When using Level 3 BLAS kernels in a multiprocessing mode, one can parallelize within each kernel, or can obtain parallelism by performing different matrix-matrix operations on different processors. We apply parallelism over the blocks. We study the amount of parallelism and we discuss the data dependency graph. The SCHEDULE package is used to obtain a portable scheduling of the tasks. Numerical results of our method are presented and compared with the results for a block algorithm parallelized within the Level 3 BLAS kernels."</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">Production scheduling</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Afdeling Numerieke Wiskunde: Report NM</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">1990,23</subfield><subfield code="w">(DE-604)BV010177152</subfield><subfield code="9">1990,23</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006772569</subfield></datafield></record></collection> |
id | DE-604.BV010192576 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:48:10Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006772569 |
oclc_num | 24807100 |
open_access_boolean | |
owner | DE-91G DE-BY-TUM |
owner_facet | DE-91G DE-BY-TUM |
physical | 20 S. |
publishDate | 1990 |
publishDateSearch | 1990 |
publishDateSort | 1990 |
record_format | marc |
series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Numerieke Wiskunde: Report NM |
spelling | Louter-Nool, Margreet Verfasser aut Block-Cholesky for parallel processing M. Louter-Nool Amsterdam 1990 20 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Numerieke Wiskunde: Report NM 1990,23 Abstract: "We concentrate on the Cholesky factorization of A=L L[superscript T], where A is a positive definite symmetric matrix and L is a lower triangular matrix. A blocked algorithm based on Level 3 BLAS is discussed. When using Level 3 BLAS kernels in a multiprocessing mode, one can parallelize within each kernel, or can obtain parallelism by performing different matrix-matrix operations on different processors. We apply parallelism over the blocks. We study the amount of parallelism and we discuss the data dependency graph. The SCHEDULE package is used to obtain a portable scheduling of the tasks. Numerical results of our method are presented and compared with the results for a block algorithm parallelized within the Level 3 BLAS kernels." Parallel processing (Electronic computers) Production scheduling Afdeling Numerieke Wiskunde: Report NM Centrum voor Wiskunde en Informatica <Amsterdam> 1990,23 (DE-604)BV010177152 1990,23 |
spellingShingle | Louter-Nool, Margreet Block-Cholesky for parallel processing Parallel processing (Electronic computers) Production scheduling |
title | Block-Cholesky for parallel processing |
title_auth | Block-Cholesky for parallel processing |
title_exact_search | Block-Cholesky for parallel processing |
title_full | Block-Cholesky for parallel processing M. Louter-Nool |
title_fullStr | Block-Cholesky for parallel processing M. Louter-Nool |
title_full_unstemmed | Block-Cholesky for parallel processing M. Louter-Nool |
title_short | Block-Cholesky for parallel processing |
title_sort | block cholesky for parallel processing |
topic | Parallel processing (Electronic computers) Production scheduling |
topic_facet | Parallel processing (Electronic computers) Production scheduling |
volume_link | (DE-604)BV010177152 |
work_keys_str_mv | AT louternoolmargreet blockcholeskyforparallelprocessing |