Parallel direct method codes for general sparse matrices:
Abstract: "In this paper, the main ideas applied in the development of three sparse codes for shared memory parallel computers are discussed. The first, Y12M1, is based on exploiting the parallelism available in the processing of a single pivot in sparse Gaussian elimination. The second, Y12M2,...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Urbana, Ill.
1991
|
| Series: | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report
1143 |
| Subjects: | |
| Summary: | Abstract: "In this paper, the main ideas applied in the development of three sparse codes for shared memory parallel computers are discussed. The first, Y12M1, is based on exploiting the parallelism available in the processing of a single pivot in sparse Gaussian elimination. The second, Y12M2, exploits the parallelism of multiple parallel pivots. The third, Y12M3, is based on a priori reordering of the matrix to an upper block-triangular form with rectangular diagonal blocks." |
| Physical Description: | 29 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009008727 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)25334764 | ||
| 035 | |a (DE-599)BVBBV009008727 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Gallivan, K. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Parallel direct method codes for general sparse matrices |c K. Gallivan ; A. Sameh ; Z. Zlatev |
| 264 | 1 | |a Urbana, Ill. |c 1991 | |
| 300 | |a 29 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 1143 | |
| 520 | 3 | |a Abstract: "In this paper, the main ideas applied in the development of three sparse codes for shared memory parallel computers are discussed. The first, Y12M1, is based on exploiting the parallelism available in the processing of a single pivot in sparse Gaussian elimination. The second, Y12M2, exploits the parallelism of multiple parallel pivots. The third, Y12M3, is based on a priori reordering of the matrix to an upper block-triangular form with rectangular diagonal blocks." | |
| 650 | 4 | |a Code theory | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 650 | 4 | |a Sparse matrices | |
| 700 | 1 | |a Sameh, A. |e Verfasser |4 aut | |
| 700 | 1 | |a Zlatev, Z. |e Verfasser |4 aut | |
| 830 | 0 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 1143 |w (DE-604)BV008930033 |9 1143 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005955214 | ||
Record in the Search Index
| _version_ | 1804123355858599936 |
|---|---|
| any_adam_object | |
| author | Gallivan, K. Sameh, A. Zlatev, Z. |
| author_facet | Gallivan, K. Sameh, A. Zlatev, Z. |
| author_role | aut aut aut |
| author_sort | Gallivan, K. |
| author_variant | k g kg a s as z z zz |
| building | Verbundindex |
| bvnumber | BV009008727 |
| ctrlnum | (OCoLC)25334764 (DE-599)BVBBV009008727 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01602nam a2200337 cb4500</leader><controlfield tag="001">BV009008727</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25334764</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009008727</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">Gallivan, K.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallel direct method codes for general sparse matrices</subfield><subfield code="c">K. Gallivan ; A. Sameh ; Z. Zlatev</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Urbana, Ill.</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">29 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">1143</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this paper, the main ideas applied in the development of three sparse codes for shared memory parallel computers are discussed. The first, Y12M1, is based on exploiting the parallelism available in the processing of a single pivot in sparse Gaussian elimination. The second, Y12M2, exploits the parallelism of multiple parallel pivots. The third, Y12M3, is based on a priori reordering of the matrix to an upper block-triangular form with rectangular diagonal blocks."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Code theory</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">Sameh, A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zlatev, Z.</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">1143</subfield><subfield code="w">(DE-604)BV008930033</subfield><subfield code="9">1143</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005955214</subfield></datafield></record></collection> |
| id | DE-604.BV009008727 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:28Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005955214 |
| oclc_num | 25334764 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 29 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| 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 | Gallivan, K. Verfasser aut Parallel direct method codes for general sparse matrices K. Gallivan ; A. Sameh ; Z. Zlatev Urbana, Ill. 1991 29 S. txt rdacontent n rdamedia nc rdacarrier Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 1143 Abstract: "In this paper, the main ideas applied in the development of three sparse codes for shared memory parallel computers are discussed. The first, Y12M1, is based on exploiting the parallelism available in the processing of a single pivot in sparse Gaussian elimination. The second, Y12M2, exploits the parallelism of multiple parallel pivots. The third, Y12M3, is based on a priori reordering of the matrix to an upper block-triangular form with rectangular diagonal blocks." Code theory Parallel processing (Electronic computers) Sparse matrices Sameh, A. Verfasser aut Zlatev, Z. Verfasser aut Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 1143 (DE-604)BV008930033 1143 |
| spellingShingle | Gallivan, K. Sameh, A. Zlatev, Z. Parallel direct method codes for general sparse matrices Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report Code theory Parallel processing (Electronic computers) Sparse matrices |
| title | Parallel direct method codes for general sparse matrices |
| title_auth | Parallel direct method codes for general sparse matrices |
| title_exact_search | Parallel direct method codes for general sparse matrices |
| title_full | Parallel direct method codes for general sparse matrices K. Gallivan ; A. Sameh ; Z. Zlatev |
| title_fullStr | Parallel direct method codes for general sparse matrices K. Gallivan ; A. Sameh ; Z. Zlatev |
| title_full_unstemmed | Parallel direct method codes for general sparse matrices K. Gallivan ; A. Sameh ; Z. Zlatev |
| title_short | Parallel direct method codes for general sparse matrices |
| title_sort | parallel direct method codes for general sparse matrices |
| topic | Code theory Parallel processing (Electronic computers) Sparse matrices |
| topic_facet | Code theory Parallel processing (Electronic computers) Sparse matrices |
| volume_link | (DE-604)BV008930033 |
| work_keys_str_mv | AT gallivank paralleldirectmethodcodesforgeneralsparsematrices AT sameha paralleldirectmethodcodesforgeneralsparsematrices AT zlatevz paralleldirectmethodcodesforgeneralsparsematrices |