From a tabular classification to parallel implementations of linearly recursive functions:
Abstract: "We propose a classification for a set of linearly recursive functions, which can be expressed as instances of a skeleton for parallel linear recursion, and present new parallel implementations for them. This set includes well known higher-order functions, like Broadcast, Reduction an...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Passau
1997
|
| Series: | MIP / Universität Passau, Fakultät für Mathematik und Informatik
1997,12 |
| Subjects: | |
| Summary: | Abstract: "We propose a classification for a set of linearly recursive functions, which can be expressed as instances of a skeleton for parallel linear recursion, and present new parallel implementations for them. This set includes well known higher-order functions, like Broadcast, Reduction and Scan, which we call basic components. Many compositions of these basic components are also linearly recursive functions; we present transformation rules from compositions of up to three basic components to instances of our skeleton. The advantage of this approach is that these instances have better parallel implementations than the compositions of the individual implementations of the corresponding basic components." |
| Physical Description: | 32, 5 S. graph. Darst. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011583255 | ||
| 003 | DE-604 | ||
| 005 | 20140217 | ||
| 007 | t| | ||
| 008 | 971020s1997 xx d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)38860350 | ||
| 035 | |a (DE-599)BVBBV011583255 | ||
| 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 | ||
| 100 | 1 | |a Wedler, Christoph |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a From a tabular classification to parallel implementations of linearly recursive functions |c Ch. Wedler ; Ch. Lengauer |
| 264 | 1 | |a Passau |c 1997 | |
| 300 | |a 32, 5 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a MIP / Universität Passau, Fakultät für Mathematik und Informatik |v 1997,12 | |
| 520 | 3 | |a Abstract: "We propose a classification for a set of linearly recursive functions, which can be expressed as instances of a skeleton for parallel linear recursion, and present new parallel implementations for them. This set includes well known higher-order functions, like Broadcast, Reduction and Scan, which we call basic components. Many compositions of these basic components are also linearly recursive functions; we present transformation rules from compositions of up to three basic components to instances of our skeleton. The advantage of this approach is that these instances have better parallel implementations than the compositions of the individual implementations of the corresponding basic components." | |
| 650 | 4 | |a Functional programming (Computer science) | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 650 | 4 | |a Recursive functions | |
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mathematik |0 (DE-588)4037944-9 |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 Universität Passau, Fakultät für Mathematik und Informatik |t MIP |v 1997,12 |w (DE-604)BV000905393 |9 1997,12 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007800898 | |
Record in the Search Index
| _version_ | 1820882317828161536 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Wedler, Christoph Lengauer, Christian |
| author_facet | Wedler, Christoph Lengauer, Christian |
| author_role | aut aut |
| author_sort | Wedler, Christoph |
| author_variant | c w cw c l cl |
| building | Verbundindex |
| bvnumber | BV011583255 |
| classification_rvk | SS 5600 |
| ctrlnum | (OCoLC)38860350 (DE-599)BVBBV011583255 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV011583255</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20140217</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">971020s1997 xx d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38860350</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011583255</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="100" ind1="1" ind2=" "><subfield code="a">Wedler, Christoph</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">From a tabular classification to parallel implementations of linearly recursive functions</subfield><subfield code="c">Ch. Wedler ; Ch. Lengauer</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">32, 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">MIP / Universität Passau, Fakultät für Mathematik und Informatik</subfield><subfield code="v">1997,12</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We propose a classification for a set of linearly recursive functions, which can be expressed as instances of a skeleton for parallel linear recursion, and present new parallel implementations for them. This set includes well known higher-order functions, like Broadcast, Reduction and Scan, which we call basic components. Many compositions of these basic components are also linearly recursive functions; we present transformation rules from compositions of up to three basic components to instances of our skeleton. The advantage of this approach is that these instances have better parallel implementations than the compositions of the individual implementations of the corresponding basic components."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Functional programming (Computer science)</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">Recursive functions</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="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">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</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">Universität Passau, Fakultät für Mathematik und Informatik</subfield><subfield code="t">MIP</subfield><subfield code="v">1997,12</subfield><subfield code="w">(DE-604)BV000905393</subfield><subfield code="9">1997,12</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007800898</subfield></datafield></record></collection> |
| id | DE-604.BV011583255 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T17:04:59Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007800898 |
| oclc_num | 38860350 |
| open_access_boolean | |
| owner | DE-154 DE-739 DE-12 DE-634 |
| owner_facet | DE-154 DE-739 DE-12 DE-634 |
| physical | 32, 5 S. graph. Darst. |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| record_format | marc |
| series2 | MIP / Universität Passau, Fakultät für Mathematik und Informatik |
| spelling | Wedler, Christoph Verfasser aut From a tabular classification to parallel implementations of linearly recursive functions Ch. Wedler ; Ch. Lengauer Passau 1997 32, 5 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier MIP / Universität Passau, Fakultät für Mathematik und Informatik 1997,12 Abstract: "We propose a classification for a set of linearly recursive functions, which can be expressed as instances of a skeleton for parallel linear recursion, and present new parallel implementations for them. This set includes well known higher-order functions, like Broadcast, Reduction and Scan, which we call basic components. Many compositions of these basic components are also linearly recursive functions; we present transformation rules from compositions of up to three basic components to instances of our skeleton. The advantage of this approach is that these instances have better parallel implementations than the compositions of the individual implementations of the corresponding basic components." Functional programming (Computer science) Parallel processing (Electronic computers) Recursive functions Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Mathematik (DE-588)4037944-9 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 Universität Passau, Fakultät für Mathematik und Informatik MIP 1997,12 (DE-604)BV000905393 1997,12 |
| spellingShingle | Wedler, Christoph Lengauer, Christian From a tabular classification to parallel implementations of linearly recursive functions Functional programming (Computer science) Parallel processing (Electronic computers) Recursive functions Theoretische Informatik (DE-588)4196735-5 gnd Informatik (DE-588)4026894-9 gnd Mathematik (DE-588)4037944-9 gnd |
| subject_GND | (DE-588)4196735-5 (DE-588)4026894-9 (DE-588)4037944-9 |
| title | From a tabular classification to parallel implementations of linearly recursive functions |
| title_auth | From a tabular classification to parallel implementations of linearly recursive functions |
| title_exact_search | From a tabular classification to parallel implementations of linearly recursive functions |
| title_full | From a tabular classification to parallel implementations of linearly recursive functions Ch. Wedler ; Ch. Lengauer |
| title_fullStr | From a tabular classification to parallel implementations of linearly recursive functions Ch. Wedler ; Ch. Lengauer |
| title_full_unstemmed | From a tabular classification to parallel implementations of linearly recursive functions Ch. Wedler ; Ch. Lengauer |
| title_short | From a tabular classification to parallel implementations of linearly recursive functions |
| title_sort | from a tabular classification to parallel implementations of linearly recursive functions |
| topic | Functional programming (Computer science) Parallel processing (Electronic computers) Recursive functions Theoretische Informatik (DE-588)4196735-5 gnd Informatik (DE-588)4026894-9 gnd Mathematik (DE-588)4037944-9 gnd |
| topic_facet | Functional programming (Computer science) Parallel processing (Electronic computers) Recursive functions Theoretische Informatik Informatik Mathematik |
| volume_link | (DE-604)BV000905393 |
| work_keys_str_mv | AT wedlerchristoph fromatabularclassificationtoparallelimplementationsoflinearlyrecursivefunctions AT lengauerchristian fromatabularclassificationtoparallelimplementationsoflinearlyrecursivefunctions |