Optimal parallel algorithms for computing recursively defined functions:
Abstract: "We investigate recursively defined functions and present optimal algorithms on parallel random access machines (PRAM's) to compute them. It is shown that if for the average width w[bar] of the recursion tree the number of PRAM processors is O(w[bar]/log w[bar]), our parallel alg...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
München
1992
|
| Series: | Technische Universität <München>: TUM-I
9218 |
| Subjects: | |
| Summary: | Abstract: "We investigate recursively defined functions and present optimal algorithms on parallel random access machines (PRAM's) to compute them. It is shown that if for the average width w[bar] of the recursion tree the number of PRAM processors is O(w[bar]/log w[bar]), our parallel algorithms need the same amount of work as the best sequential algorithms for these problems up to a constant factor. In addition, this is possible using the weakest PRAM model, i.e., OROW-PRAM's (owner read, owner write parallel random access machines)." |
| Physical Description: | 28 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009225218 | ||
| 003 | DE-604 | ||
| 005 | 20230116 | ||
| 007 | t | ||
| 008 | 940313s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)28491309 | ||
| 035 | |a (DE-599)BVBBV009225218 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-12 |a DE-91G | ||
| 100 | 1 | |a Niedermeier, Rolf |d 19XX- |e Verfasser |0 (DE-588)105937899X |4 aut | |
| 245 | 1 | 0 | |a Optimal parallel algorithms for computing recursively defined functions |c Rolf Niedermeier and Peter Rossmanith |
| 264 | 1 | |a München |c 1992 | |
| 300 | |a 28 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Technische Universität <München>: TUM-I |v 9218 | |
| 490 | 1 | |a Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht / A |v 1992,12 | |
| 520 | 3 | |a Abstract: "We investigate recursively defined functions and present optimal algorithms on parallel random access machines (PRAM's) to compute them. It is shown that if for the average width w[bar] of the recursion tree the number of PRAM processors is O(w[bar]/log w[bar]), our parallel algorithms need the same amount of work as the best sequential algorithms for these problems up to a constant factor. In addition, this is possible using the weakest PRAM model, i.e., OROW-PRAM's (owner read, owner write parallel random access machines)." | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Recursive functions | |
| 700 | 1 | |a Rossmanith, Peter |e Verfasser |0 (DE-588)1084817721 |4 aut | |
| 810 | 2 | |a A |t Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht |v 1992,12 |w (DE-604)BV004627888 |9 1992,12 | |
| 830 | 0 | |a Technische Universität <München>: TUM-I |v 9218 |w (DE-604)BV006185376 |9 9218 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006134320 | ||
Record in the Search Index
| _version_ | 1804123668357316608 |
|---|---|
| any_adam_object | |
| author | Niedermeier, Rolf 19XX- Rossmanith, Peter |
| author_GND | (DE-588)105937899X (DE-588)1084817721 |
| author_facet | Niedermeier, Rolf 19XX- Rossmanith, Peter |
| author_role | aut aut |
| author_sort | Niedermeier, Rolf 19XX- |
| author_variant | r n rn p r pr |
| building | Verbundindex |
| bvnumber | BV009225218 |
| ctrlnum | (OCoLC)28491309 (DE-599)BVBBV009225218 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01892nam a2200337 cb4500</leader><controlfield tag="001">BV009225218</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230116 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28491309</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009225218</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-12</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Niedermeier, Rolf</subfield><subfield code="d">19XX-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)105937899X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimal parallel algorithms for computing recursively defined functions</subfield><subfield code="c">Rolf Niedermeier and Peter Rossmanith</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">28 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">Technische Universität <München>: TUM-I</subfield><subfield code="v">9218</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht / A</subfield><subfield code="v">1992,12</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We investigate recursively defined functions and present optimal algorithms on parallel random access machines (PRAM's) to compute them. It is shown that if for the average width w[bar] of the recursion tree the number of PRAM processors is O(w[bar]/log w[bar]), our parallel algorithms need the same amount of work as the best sequential algorithms for these problems up to a constant factor. In addition, this is possible using the weakest PRAM model, i.e., OROW-PRAM's (owner read, owner write parallel random access machines)."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursive functions</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rossmanith, Peter</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1084817721</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">A</subfield><subfield code="t">Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht</subfield><subfield code="v">1992,12</subfield><subfield code="w">(DE-604)BV004627888</subfield><subfield code="9">1992,12</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Technische Universität <München>: TUM-I</subfield><subfield code="v">9218</subfield><subfield code="w">(DE-604)BV006185376</subfield><subfield code="9">9218</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006134320</subfield></datafield></record></collection> |
| id | DE-604.BV009225218 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:33:26Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006134320 |
| oclc_num | 28491309 |
| open_access_boolean | |
| owner | DE-29T DE-12 DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-12 DE-91G DE-BY-TUM |
| physical | 28 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series | Technische Universität <München>: TUM-I |
| series2 | Technische Universität <München>: TUM-I Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht / A |
| spelling | Niedermeier, Rolf 19XX- Verfasser (DE-588)105937899X aut Optimal parallel algorithms for computing recursively defined functions Rolf Niedermeier and Peter Rossmanith München 1992 28 S. txt rdacontent n rdamedia nc rdacarrier Technische Universität <München>: TUM-I 9218 Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht / A 1992,12 Abstract: "We investigate recursively defined functions and present optimal algorithms on parallel random access machines (PRAM's) to compute them. It is shown that if for the average width w[bar] of the recursion tree the number of PRAM processors is O(w[bar]/log w[bar]), our parallel algorithms need the same amount of work as the best sequential algorithms for these problems up to a constant factor. In addition, this is possible using the weakest PRAM model, i.e., OROW-PRAM's (owner read, owner write parallel random access machines)." Computer algorithms Recursive functions Rossmanith, Peter Verfasser (DE-588)1084817721 aut A Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht 1992,12 (DE-604)BV004627888 1992,12 Technische Universität <München>: TUM-I 9218 (DE-604)BV006185376 9218 |
| spellingShingle | Niedermeier, Rolf 19XX- Rossmanith, Peter Optimal parallel algorithms for computing recursively defined functions Technische Universität <München>: TUM-I Computer algorithms Recursive functions |
| title | Optimal parallel algorithms for computing recursively defined functions |
| title_auth | Optimal parallel algorithms for computing recursively defined functions |
| title_exact_search | Optimal parallel algorithms for computing recursively defined functions |
| title_full | Optimal parallel algorithms for computing recursively defined functions Rolf Niedermeier and Peter Rossmanith |
| title_fullStr | Optimal parallel algorithms for computing recursively defined functions Rolf Niedermeier and Peter Rossmanith |
| title_full_unstemmed | Optimal parallel algorithms for computing recursively defined functions Rolf Niedermeier and Peter Rossmanith |
| title_short | Optimal parallel algorithms for computing recursively defined functions |
| title_sort | optimal parallel algorithms for computing recursively defined functions |
| topic | Computer algorithms Recursive functions |
| topic_facet | Computer algorithms Recursive functions |
| volume_link | (DE-604)BV004627888 (DE-604)BV006185376 |
| work_keys_str_mv | AT niedermeierrolf optimalparallelalgorithmsforcomputingrecursivelydefinedfunctions AT rossmanithpeter optimalparallelalgorithmsforcomputingrecursivelydefinedfunctions |