Parallelization of divide and conquer by translation to nested loops:
Abstract: "We propose a sequence of equational transformations and specializations which turns a divide-and-conquer skeleton in Haskell into a parallel loop nest in C. Our initial skeleton is often viewed as general divide-and-conquer. The specializations impose a balanced call tree, a fixed de...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Passau
1997
|
| Schriftenreihe: | Universität <Passau> / Fakultät für Mathematik und Informatik: MIP
1997,05 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We propose a sequence of equational transformations and specializations which turns a divide-and-conquer skeleton in Haskell into a parallel loop nest in C. Our initial skeleton is often viewed as general divide-and-conquer. The specializations impose a balanced call tree, a fixed degree of the problem division, and elementwise operations. Our goal is to select parallel implementations of divide-and-conquer via a space-time mapping, which can be determined at compile time. The correctness of our transformations is proved by equational reasoning in Haskell; recursion and iteration are handled by induction. Finally, we demonstrate the practicality of the skeleton by expressing Strassen's matrix multiplication in it." |
| Beschreibung: | 33, 5 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011352109 | ||
| 003 | DE-604 | ||
| 005 | 19980217 | ||
| 007 | t | ||
| 008 | 970522s1997 d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)38860365 | ||
| 035 | |a (DE-599)BVBBV011352109 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-154 |a DE-739 |a DE-12 |a DE-634 | ||
| 084 | |a SS 5600 |0 (DE-625)143571: |2 rvk | ||
| 100 | 1 | |a Herrmann, Christoph A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Parallelization of divide and conquer by translation to nested loops |c Chr. A. Herrmann ; Chr. Lengauer |
| 246 | 1 | 3 | |a Parallelization of divide-and-conquer by translation to nested loops |
| 264 | 1 | |a Passau |c 1997 | |
| 300 | |a 33, 5 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Universität <Passau> / Fakultät für Mathematik und Informatik: MIP |v 1997,05 | |
| 520 | 3 | |a Abstract: "We propose a sequence of equational transformations and specializations which turns a divide-and-conquer skeleton in Haskell into a parallel loop nest in C. Our initial skeleton is often viewed as general divide-and-conquer. The specializations impose a balanced call tree, a fixed degree of the problem division, and elementwise operations. Our goal is to select parallel implementations of divide-and-conquer via a space-time mapping, which can be determined at compile time. The correctness of our transformations is proved by equational reasoning in Haskell; recursion and iteration are handled by induction. Finally, we demonstrate the practicality of the skeleton by expressing Strassen's matrix multiplication in it." | |
| 650 | 4 | |a Computer programming | |
| 650 | 4 | |a Parallel programming (Computer science) | |
| 650 | 4 | |a Programming languages (Electronic computers) | |
| 650 | 0 | 7 | |a Mathematik |0 (DE-588)4037944-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 0 | 1 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 0 | 2 | |a Mathematik |0 (DE-588)4037944-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Lengauer, Christian |e Verfasser |4 aut | |
| 810 | 2 | |a Fakultät für Mathematik und Informatik: MIP |t Universität <Passau> |v 1997,05 |w (DE-604)BV000905393 |9 1997,05 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007628262 | ||
Datensatz im Suchindex
| _version_ | 1804125861809487872 |
|---|---|
| any_adam_object | |
| author | Herrmann, Christoph A. Lengauer, Christian |
| author_facet | Herrmann, Christoph A. Lengauer, Christian |
| author_role | aut aut |
| author_sort | Herrmann, Christoph A. |
| author_variant | c a h ca cah c l cl |
| building | Verbundindex |
| bvnumber | BV011352109 |
| classification_rvk | SS 5600 |
| ctrlnum | (OCoLC)38860365 (DE-599)BVBBV011352109 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02412nam a2200433 cb4500</leader><controlfield tag="001">BV011352109</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19980217 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">970522s1997 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38860365</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011352109</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-154</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 5600</subfield><subfield code="0">(DE-625)143571:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Herrmann, Christoph A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallelization of divide and conquer by translation to nested loops</subfield><subfield code="c">Chr. A. Herrmann ; Chr. Lengauer</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Parallelization of divide-and-conquer by translation to nested loops</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Passau</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">33, 5 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">Universität <Passau> / Fakultät für Mathematik und Informatik: MIP</subfield><subfield code="v">1997,05</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We propose a sequence of equational transformations and specializations which turns a divide-and-conquer skeleton in Haskell into a parallel loop nest in C. Our initial skeleton is often viewed as general divide-and-conquer. The specializations impose a balanced call tree, a fixed degree of the problem division, and elementwise operations. Our goal is to select parallel implementations of divide-and-conquer via a space-time mapping, which can be determined at compile time. The correctness of our transformations is proved by equational reasoning in Haskell; recursion and iteration are handled by induction. Finally, we demonstrate the practicality of the skeleton by expressing Strassen's matrix multiplication in it."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming languages (Electronic computers)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lengauer, Christian</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Fakultät für Mathematik und Informatik: MIP</subfield><subfield code="t">Universität <Passau></subfield><subfield code="v">1997,05</subfield><subfield code="w">(DE-604)BV000905393</subfield><subfield code="9">1997,05</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007628262</subfield></datafield></record></collection> |
| id | DE-604.BV011352109 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:08:17Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007628262 |
| oclc_num | 38860365 |
| open_access_boolean | |
| owner | DE-154 DE-739 DE-12 DE-634 |
| owner_facet | DE-154 DE-739 DE-12 DE-634 |
| physical | 33, 5 S. graph. Darst. |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| record_format | marc |
| series2 | Universität <Passau> / Fakultät für Mathematik und Informatik: MIP |
| spelling | Herrmann, Christoph A. Verfasser aut Parallelization of divide and conquer by translation to nested loops Chr. A. Herrmann ; Chr. Lengauer Parallelization of divide-and-conquer by translation to nested loops Passau 1997 33, 5 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Universität <Passau> / Fakultät für Mathematik und Informatik: MIP 1997,05 Abstract: "We propose a sequence of equational transformations and specializations which turns a divide-and-conquer skeleton in Haskell into a parallel loop nest in C. Our initial skeleton is often viewed as general divide-and-conquer. The specializations impose a balanced call tree, a fixed degree of the problem division, and elementwise operations. Our goal is to select parallel implementations of divide-and-conquer via a space-time mapping, which can be determined at compile time. The correctness of our transformations is proved by equational reasoning in Haskell; recursion and iteration are handled by induction. Finally, we demonstrate the practicality of the skeleton by expressing Strassen's matrix multiplication in it." Computer programming Parallel programming (Computer science) Programming languages (Electronic computers) Mathematik (DE-588)4037944-9 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 s Informatik (DE-588)4026894-9 s Mathematik (DE-588)4037944-9 s DE-604 Lengauer, Christian Verfasser aut Fakultät für Mathematik und Informatik: MIP Universität <Passau> 1997,05 (DE-604)BV000905393 1997,05 |
| spellingShingle | Herrmann, Christoph A. Lengauer, Christian Parallelization of divide and conquer by translation to nested loops Computer programming Parallel programming (Computer science) Programming languages (Electronic computers) Mathematik (DE-588)4037944-9 gnd Informatik (DE-588)4026894-9 gnd Theoretische Informatik (DE-588)4196735-5 gnd |
| subject_GND | (DE-588)4037944-9 (DE-588)4026894-9 (DE-588)4196735-5 |
| title | Parallelization of divide and conquer by translation to nested loops |
| title_alt | Parallelization of divide-and-conquer by translation to nested loops |
| title_auth | Parallelization of divide and conquer by translation to nested loops |
| title_exact_search | Parallelization of divide and conquer by translation to nested loops |
| title_full | Parallelization of divide and conquer by translation to nested loops Chr. A. Herrmann ; Chr. Lengauer |
| title_fullStr | Parallelization of divide and conquer by translation to nested loops Chr. A. Herrmann ; Chr. Lengauer |
| title_full_unstemmed | Parallelization of divide and conquer by translation to nested loops Chr. A. Herrmann ; Chr. Lengauer |
| title_short | Parallelization of divide and conquer by translation to nested loops |
| title_sort | parallelization of divide and conquer by translation to nested loops |
| topic | Computer programming Parallel programming (Computer science) Programming languages (Electronic computers) Mathematik (DE-588)4037944-9 gnd Informatik (DE-588)4026894-9 gnd Theoretische Informatik (DE-588)4196735-5 gnd |
| topic_facet | Computer programming Parallel programming (Computer science) Programming languages (Electronic computers) Mathematik Informatik Theoretische Informatik |
| volume_link | (DE-604)BV000905393 |
| work_keys_str_mv | AT herrmannchristopha parallelizationofdivideandconquerbytranslationtonestedloops AT lengauerchristian parallelizationofdivideandconquerbytranslationtonestedloops |