Sequential optimization and data distribution for ARC2D on the Cedar hierarchical multiprocessor:
Abstract: "The Fortran code ARC2D from the Perfect Benchmark Suite is described, and its optimization for a hierarchical shared memory multiprocessor (Cedar) is presented. First sequential optimizations are described, which reduce the number of floating point operations by 33% and improve data...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Urbana, Ill.
1991
|
| Schriftenreihe: | Center for Supercomputing Research and Development <Urbana, Ill,>: CSRD report
1128 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The Fortran code ARC2D from the Perfect Benchmark Suite is described, and its optimization for a hierarchical shared memory multiprocessor (Cedar) is presented. First sequential optimizations are described, which reduce the number of floating point operations by 33% and improve data locality. For the Cedar version, the data is distributed among the cluster memories, instead of placing the data into global memory and simply using Cedar as a 32 processor shared memory machine. The approach is commonly called domain decomposition but is more accurately described as data decomposition or data distribution." |
| Beschreibung: | 48 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008992776 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)25835588 | ||
| 035 | |a (DE-599)BVBBV008992776 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Bramley, Randy |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Sequential optimization and data distribution for ARC2D on the Cedar hierarchical multiprocessor |c Randy Bramley |
| 264 | 1 | |a Urbana, Ill. |c 1991 | |
| 300 | |a 48 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 1128 | |
| 520 | 3 | |a Abstract: "The Fortran code ARC2D from the Perfect Benchmark Suite is described, and its optimization for a hierarchical shared memory multiprocessor (Cedar) is presented. First sequential optimizations are described, which reduce the number of floating point operations by 33% and improve data locality. For the Cedar version, the data is distributed among the cluster memories, instead of placing the data into global memory and simply using Cedar as a 32 processor shared memory machine. The approach is commonly called domain decomposition but is more accurately described as data decomposition or data distribution." | |
| 650 | 4 | |a Distributed databases | |
| 650 | 4 | |a Multiprocessors | |
| 650 | 4 | |a Sequential machine theory | |
| 830 | 0 | |a Center for Supercomputing Research and Development <Urbana, Ill,>: CSRD report |v 1128 |w (DE-604)BV008930033 |9 1128 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005941695 | ||
Datensatz im Suchindex
| _version_ | 1804123335290781696 |
|---|---|
| any_adam_object | |
| author | Bramley, Randy |
| author_facet | Bramley, Randy |
| author_role | aut |
| author_sort | Bramley, Randy |
| author_variant | r b rb |
| building | Verbundindex |
| bvnumber | BV008992776 |
| ctrlnum | (OCoLC)25835588 (DE-599)BVBBV008992776 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01670nam a2200313 cb4500</leader><controlfield tag="001">BV008992776</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)25835588</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008992776</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">Bramley, Randy</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Sequential optimization and data distribution for ARC2D on the Cedar hierarchical multiprocessor</subfield><subfield code="c">Randy Bramley</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">48 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">1128</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The Fortran code ARC2D from the Perfect Benchmark Suite is described, and its optimization for a hierarchical shared memory multiprocessor (Cedar) is presented. First sequential optimizations are described, which reduce the number of floating point operations by 33% and improve data locality. For the Cedar version, the data is distributed among the cluster memories, instead of placing the data into global memory and simply using Cedar as a 32 processor shared memory machine. The approach is commonly called domain decomposition but is more accurately described as data decomposition or data distribution."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Distributed databases</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiprocessors</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sequential machine theory</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">1128</subfield><subfield code="w">(DE-604)BV008930033</subfield><subfield code="9">1128</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005941695</subfield></datafield></record></collection> |
| id | DE-604.BV008992776 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:08Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005941695 |
| oclc_num | 25835588 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 48 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 | Bramley, Randy Verfasser aut Sequential optimization and data distribution for ARC2D on the Cedar hierarchical multiprocessor Randy Bramley Urbana, Ill. 1991 48 S. txt rdacontent n rdamedia nc rdacarrier Center for Supercomputing Research and Development <Urbana, Ill,>: CSRD report 1128 Abstract: "The Fortran code ARC2D from the Perfect Benchmark Suite is described, and its optimization for a hierarchical shared memory multiprocessor (Cedar) is presented. First sequential optimizations are described, which reduce the number of floating point operations by 33% and improve data locality. For the Cedar version, the data is distributed among the cluster memories, instead of placing the data into global memory and simply using Cedar as a 32 processor shared memory machine. The approach is commonly called domain decomposition but is more accurately described as data decomposition or data distribution." Distributed databases Multiprocessors Sequential machine theory Center for Supercomputing Research and Development <Urbana, Ill,>: CSRD report 1128 (DE-604)BV008930033 1128 |
| spellingShingle | Bramley, Randy Sequential optimization and data distribution for ARC2D on the Cedar hierarchical multiprocessor Center for Supercomputing Research and Development <Urbana, Ill,>: CSRD report Distributed databases Multiprocessors Sequential machine theory |
| title | Sequential optimization and data distribution for ARC2D on the Cedar hierarchical multiprocessor |
| title_auth | Sequential optimization and data distribution for ARC2D on the Cedar hierarchical multiprocessor |
| title_exact_search | Sequential optimization and data distribution for ARC2D on the Cedar hierarchical multiprocessor |
| title_full | Sequential optimization and data distribution for ARC2D on the Cedar hierarchical multiprocessor Randy Bramley |
| title_fullStr | Sequential optimization and data distribution for ARC2D on the Cedar hierarchical multiprocessor Randy Bramley |
| title_full_unstemmed | Sequential optimization and data distribution for ARC2D on the Cedar hierarchical multiprocessor Randy Bramley |
| title_short | Sequential optimization and data distribution for ARC2D on the Cedar hierarchical multiprocessor |
| title_sort | sequential optimization and data distribution for arc2d on the cedar hierarchical multiprocessor |
| topic | Distributed databases Multiprocessors Sequential machine theory |
| topic_facet | Distributed databases Multiprocessors Sequential machine theory |
| volume_link | (DE-604)BV008930033 |
| work_keys_str_mv | AT bramleyrandy sequentialoptimizationanddatadistributionforarc2donthecedarhierarchicalmultiprocessor |