The performance impact of data reuse in parallel dense cholesky factorizationl:
Abstract: "This paper explores performance issues for several prominent approaches to parallel dense Cholesky factorization. The primary focus is on issues that arise when blocking techniques are integrated into parallel factorization approaches to improve data reuse in the memory hierarchy. We...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1992
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN CS
1401 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper explores performance issues for several prominent approaches to parallel dense Cholesky factorization. The primary focus is on issues that arise when blocking techniques are integrated into parallel factorization approaches to improve data reuse in the memory hierarchy. We first consider panel-oriented approaches, where sets of contiguous columns are manipulated as single units. These methods represent natural extensions of the column-oriented methods that have been widely used previously. On machines with memory hierarchies, panel- oriented methods significantly increase the achieved performance over column-oriented methods. |
| Beschreibung: | 28 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008993184 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1992 d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)29182660 | ||
| 035 | |a (DE-599)BVBBV008993184 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 050 | 0 | |a QA76.58 | |
| 082 | 0 | |a 004/.35 |2 20 | |
| 100 | 1 | |a Rathberg, Edward |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The performance impact of data reuse in parallel dense cholesky factorizationl |c by Edward Rothberg and Anoop Gupta |
| 246 | 1 | 3 | |a Reportnr. CSL TR 92 503 |
| 264 | 1 | |a Stanford, Calif. |c 1992 | |
| 300 | |a 28 S. |b graph. Darst. | ||
| 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 1401 | |
| 520 | 3 | |a Abstract: "This paper explores performance issues for several prominent approaches to parallel dense Cholesky factorization. The primary focus is on issues that arise when blocking techniques are integrated into parallel factorization approaches to improve data reuse in the memory hierarchy. We first consider panel-oriented approaches, where sets of contiguous columns are manipulated as single units. These methods represent natural extensions of the column-oriented methods that have been widely used previously. On machines with memory hierarchies, panel- oriented methods significantly increase the achieved performance over column-oriented methods. | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 4 | |a Multiprocessors | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 700 | 1 | |a Gupta, Anoop |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1401 |w (DE-604)BV008928280 |9 1401 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005942007 | ||
Datensatz im Suchindex
| _version_ | 1804123335695532032 |
|---|---|
| any_adam_object | |
| author | Rathberg, Edward Gupta, Anoop |
| author_facet | Rathberg, Edward Gupta, Anoop |
| author_role | aut aut |
| author_sort | Rathberg, Edward |
| author_variant | e r er a g ag |
| building | Verbundindex |
| bvnumber | BV008993184 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.58 |
| callnumber-search | QA76.58 |
| callnumber-sort | QA 276.58 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)29182660 (DE-599)BVBBV008993184 |
| dewey-full | 004/.35 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004/.35 |
| dewey-search | 004/.35 |
| dewey-sort | 14 235 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01884nam a2200361 cb4500</leader><controlfield tag="001">BV008993184</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1992 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)29182660</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008993184</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="050" ind1=" " ind2="0"><subfield code="a">QA76.58</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004/.35</subfield><subfield code="2">20</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rathberg, Edward</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The performance impact of data reuse in parallel dense cholesky factorizationl</subfield><subfield code="c">by Edward Rothberg and Anoop Gupta</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Reportnr. CSL TR 92 503</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">28 S.</subfield><subfield code="b">graph. Darst.</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">1401</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper explores performance issues for several prominent approaches to parallel dense Cholesky factorization. The primary focus is on issues that arise when blocking techniques are integrated into parallel factorization approaches to improve data reuse in the memory hierarchy. We first consider panel-oriented approaches, where sets of contiguous columns are manipulated as single units. These methods represent natural extensions of the column-oriented methods that have been widely used previously. On machines with memory hierarchies, panel- oriented methods significantly increase the achieved performance over column-oriented methods.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiprocessors</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">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">1401</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1401</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005942007</subfield></datafield></record></collection> |
| id | DE-604.BV008993184 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:28:08Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005942007 |
| oclc_num | 29182660 |
| open_access_boolean | |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 28 S. graph. Darst. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spelling | Rathberg, Edward Verfasser aut The performance impact of data reuse in parallel dense cholesky factorizationl by Edward Rothberg and Anoop Gupta Reportnr. CSL TR 92 503 Stanford, Calif. 1992 28 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN CS 1401 Abstract: "This paper explores performance issues for several prominent approaches to parallel dense Cholesky factorization. The primary focus is on issues that arise when blocking techniques are integrated into parallel factorization approaches to improve data reuse in the memory hierarchy. We first consider panel-oriented approaches, where sets of contiguous columns are manipulated as single units. These methods represent natural extensions of the column-oriented methods that have been widely used previously. On machines with memory hierarchies, panel- oriented methods significantly increase the achieved performance over column-oriented methods. Data structures (Computer science) Multiprocessors Parallel processing (Electronic computers) Gupta, Anoop Verfasser aut Computer Science Department: Report STAN CS Stanford University 1401 (DE-604)BV008928280 1401 |
| spellingShingle | Rathberg, Edward Gupta, Anoop The performance impact of data reuse in parallel dense cholesky factorizationl Data structures (Computer science) Multiprocessors Parallel processing (Electronic computers) |
| title | The performance impact of data reuse in parallel dense cholesky factorizationl |
| title_alt | Reportnr. CSL TR 92 503 |
| title_auth | The performance impact of data reuse in parallel dense cholesky factorizationl |
| title_exact_search | The performance impact of data reuse in parallel dense cholesky factorizationl |
| title_full | The performance impact of data reuse in parallel dense cholesky factorizationl by Edward Rothberg and Anoop Gupta |
| title_fullStr | The performance impact of data reuse in parallel dense cholesky factorizationl by Edward Rothberg and Anoop Gupta |
| title_full_unstemmed | The performance impact of data reuse in parallel dense cholesky factorizationl by Edward Rothberg and Anoop Gupta |
| title_short | The performance impact of data reuse in parallel dense cholesky factorizationl |
| title_sort | the performance impact of data reuse in parallel dense cholesky factorizationl |
| topic | Data structures (Computer science) Multiprocessors Parallel processing (Electronic computers) |
| topic_facet | Data structures (Computer science) Multiprocessors Parallel processing (Electronic computers) |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT rathbergedward theperformanceimpactofdatareuseinparalleldensecholeskyfactorizationl AT guptaanoop theperformanceimpactofdatareuseinparalleldensecholeskyfactorizationl AT rathbergedward reportnrcsltr92503 AT guptaanoop reportnrcsltr92503 |