Optimal tree contraction and term matching on the hypercube and related networks:
Abstract: "An optimal tree contraction algorithm for the boolean hypercube and the constant degree hypercubic networks, such as the shuffle exchange or the butterfly network, is presented. The algorithm is based on novel routing techniques and, for certain small subtrees, simulates optimal PRAM...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | German |
| Veröffentlicht: |
München
1995
|
| Schriftenreihe: | Technische Universität <München>: TUM-I
9532 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "An optimal tree contraction algorithm for the boolean hypercube and the constant degree hypercubic networks, such as the shuffle exchange or the butterfly network, is presented. The algorithm is based on novel routing techniques and, for certain small subtrees, simulates optimal PRAM algorithms. For trees of size n, stored on a p processor hypercube in in-order, the running time of the algorithm is O([n/p] log p). The resulting speed-up of O(p/log p) is optimal due to logarithmic communication overhead, as shown by a corresponding lower bound. The same algorithmic ingredients can also be used to solve the term matching problem, one of the fundamental problems in logic programming." |
| Beschreibung: | Literaturverz. S. 15 - 19 |
| Beschreibung: | 17 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010841164 | ||
| 003 | DE-604 | ||
| 005 | 20040416 | ||
| 007 | t | ||
| 008 | 960701s1995 gw d||| t||| 00||| ger d | ||
| 016 | 7 | |a 947799028 |2 DE-101 | |
| 035 | |a (OCoLC)35746909 | ||
| 035 | |a (DE-599)BVBBV010841164 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-12 |a DE-91G | ||
| 088 | |a TUM I 9532 | ||
| 100 | 1 | |a Mayr, Ernst W. |d 1950- |e Verfasser |0 (DE-588)109817923 |4 aut | |
| 245 | 1 | 0 | |a Optimal tree contraction and term matching on the hypercube and related networks |c Ernst W. Mayr ; Ralph Werchner |
| 264 | 1 | |a München |c 1995 | |
| 300 | |a 17 S. |b graph. Darst. | ||
| 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 9532 | |
| 500 | |a Literaturverz. S. 15 - 19 | ||
| 520 | 3 | |a Abstract: "An optimal tree contraction algorithm for the boolean hypercube and the constant degree hypercubic networks, such as the shuffle exchange or the butterfly network, is presented. The algorithm is based on novel routing techniques and, for certain small subtrees, simulates optimal PRAM algorithms. For trees of size n, stored on a p processor hypercube in in-order, the running time of the algorithm is O([n/p] log p). The resulting speed-up of O(p/log p) is optimal due to logarithmic communication overhead, as shown by a corresponding lower bound. The same algorithmic ingredients can also be used to solve the term matching problem, one of the fundamental problems in logic programming." | |
| 650 | 4 | |a Hypercube networks (Computer networks) | |
| 650 | 4 | |a Logic programming | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 650 | 4 | |a Trees (Graph theory) | |
| 700 | 1 | |a Werchner, Ralph |e Verfasser |4 aut | |
| 830 | 0 | |a Technische Universität <München>: TUM-I |v 9532 |w (DE-604)BV006185376 |9 9532 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007246852 | ||
Datensatz im Suchindex
| _version_ | 1804125328856055808 |
|---|---|
| any_adam_object | |
| author | Mayr, Ernst W. 1950- Werchner, Ralph |
| author_GND | (DE-588)109817923 |
| author_facet | Mayr, Ernst W. 1950- Werchner, Ralph |
| author_role | aut aut |
| author_sort | Mayr, Ernst W. 1950- |
| author_variant | e w m ew ewm r w rw |
| building | Verbundindex |
| bvnumber | BV010841164 |
| ctrlnum | (OCoLC)35746909 (DE-599)BVBBV010841164 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01961nam a2200385 cb4500</leader><controlfield tag="001">BV010841164</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040416 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960701s1995 gw d||| t||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">947799028</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35746909</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010841164</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">TUM I 9532</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mayr, Ernst W.</subfield><subfield code="d">1950-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)109817923</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimal tree contraction and term matching on the hypercube and related networks</subfield><subfield code="c">Ernst W. Mayr ; Ralph Werchner</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17 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">Technische Universität <München>: TUM-I</subfield><subfield code="v">9532</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 15 - 19</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "An optimal tree contraction algorithm for the boolean hypercube and the constant degree hypercubic networks, such as the shuffle exchange or the butterfly network, is presented. The algorithm is based on novel routing techniques and, for certain small subtrees, simulates optimal PRAM algorithms. For trees of size n, stored on a p processor hypercube in in-order, the running time of the algorithm is O([n/p] log p). The resulting speed-up of O(p/log p) is optimal due to logarithmic communication overhead, as shown by a corresponding lower bound. The same algorithmic ingredients can also be used to solve the term matching problem, one of the fundamental problems in logic programming."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Hypercube networks (Computer networks)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rewriting systems (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trees (Graph theory)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Werchner, Ralph</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Technische Universität <München>: TUM-I</subfield><subfield code="v">9532</subfield><subfield code="w">(DE-604)BV006185376</subfield><subfield code="9">9532</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007246852</subfield></datafield></record></collection> |
| id | DE-604.BV010841164 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:59:49Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007246852 |
| oclc_num | 35746909 |
| open_access_boolean | |
| owner | DE-12 DE-91G DE-BY-TUM |
| owner_facet | DE-12 DE-91G DE-BY-TUM |
| physical | 17 S. graph. Darst. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series | Technische Universität <München>: TUM-I |
| series2 | Technische Universität <München>: TUM-I |
| spelling | Mayr, Ernst W. 1950- Verfasser (DE-588)109817923 aut Optimal tree contraction and term matching on the hypercube and related networks Ernst W. Mayr ; Ralph Werchner München 1995 17 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Technische Universität <München>: TUM-I 9532 Literaturverz. S. 15 - 19 Abstract: "An optimal tree contraction algorithm for the boolean hypercube and the constant degree hypercubic networks, such as the shuffle exchange or the butterfly network, is presented. The algorithm is based on novel routing techniques and, for certain small subtrees, simulates optimal PRAM algorithms. For trees of size n, stored on a p processor hypercube in in-order, the running time of the algorithm is O([n/p] log p). The resulting speed-up of O(p/log p) is optimal due to logarithmic communication overhead, as shown by a corresponding lower bound. The same algorithmic ingredients can also be used to solve the term matching problem, one of the fundamental problems in logic programming." Hypercube networks (Computer networks) Logic programming Rewriting systems (Computer science) Trees (Graph theory) Werchner, Ralph Verfasser aut Technische Universität <München>: TUM-I 9532 (DE-604)BV006185376 9532 |
| spellingShingle | Mayr, Ernst W. 1950- Werchner, Ralph Optimal tree contraction and term matching on the hypercube and related networks Technische Universität <München>: TUM-I Hypercube networks (Computer networks) Logic programming Rewriting systems (Computer science) Trees (Graph theory) |
| title | Optimal tree contraction and term matching on the hypercube and related networks |
| title_auth | Optimal tree contraction and term matching on the hypercube and related networks |
| title_exact_search | Optimal tree contraction and term matching on the hypercube and related networks |
| title_full | Optimal tree contraction and term matching on the hypercube and related networks Ernst W. Mayr ; Ralph Werchner |
| title_fullStr | Optimal tree contraction and term matching on the hypercube and related networks Ernst W. Mayr ; Ralph Werchner |
| title_full_unstemmed | Optimal tree contraction and term matching on the hypercube and related networks Ernst W. Mayr ; Ralph Werchner |
| title_short | Optimal tree contraction and term matching on the hypercube and related networks |
| title_sort | optimal tree contraction and term matching on the hypercube and related networks |
| topic | Hypercube networks (Computer networks) Logic programming Rewriting systems (Computer science) Trees (Graph theory) |
| topic_facet | Hypercube networks (Computer networks) Logic programming Rewriting systems (Computer science) Trees (Graph theory) |
| volume_link | (DE-604)BV006185376 |
| work_keys_str_mv | AT mayrernstw optimaltreecontractionandtermmatchingonthehypercubeandrelatednetworks AT werchnerralph optimaltreecontractionandtermmatchingonthehypercubeandrelatednetworks |