A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube:
Abstract: "The d-dimensional binary hypercube is a very popular model of parallel computation. On the other hand, the execution of many algorithms can be represented by binary trees, making desirable fast simulations of binary trees on hypercubes. In this paper, we present a simple one-to-one e...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
München
1993
|
| Schriftenreihe: | Technische Universität <München>: TUM-I
9321 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The d-dimensional binary hypercube is a very popular model of parallel computation. On the other hand, the execution of many algorithms can be represented by binary trees, making desirable fast simulations of binary trees on hypercubes. In this paper, we present a simple one-to-one embedding of arbitrary binary trees into their optimal hypercubes with dilation 8 and constant congestion. The novelty of our method is based on the use of an intermediate quadtree data structure, which also permits the embedding to be efficiently computed on the hypercube itself." |
| Beschreibung: | 20 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009253727 | ||
| 003 | DE-604 | ||
| 005 | 20040414 | ||
| 007 | t | ||
| 008 | 940314s1993 gw d||| t||| 00||| eng d | ||
| 016 | 7 | |a 940457415 |2 DE-101 | |
| 035 | |a (OCoLC)31897457 | ||
| 035 | |a (DE-599)BVBBV009253727 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-29T |a DE-12 |a DE-91G | ||
| 100 | 1 | |a Heun, Volker |e Verfasser |0 (DE-588)124668585 |4 aut | |
| 245 | 1 | 0 | |a A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube |c Volker Heun ; Ernst W. Mayr |
| 264 | 1 | |a München |c 1993 | |
| 300 | |a 20 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 9321 | |
| 520 | 3 | |a Abstract: "The d-dimensional binary hypercube is a very popular model of parallel computation. On the other hand, the execution of many algorithms can be represented by binary trees, making desirable fast simulations of binary trees on hypercubes. In this paper, we present a simple one-to-one embedding of arbitrary binary trees into their optimal hypercubes with dilation 8 and constant congestion. The novelty of our method is based on the use of an intermediate quadtree data structure, which also permits the embedding to be efficiently computed on the hypercube itself." | |
| 650 | 4 | |a Hypercube | |
| 700 | 1 | |a Mayr, Ernst W. |d 1950- |e Verfasser |0 (DE-588)109817923 |4 aut | |
| 830 | 0 | |a Technische Universität <München>: TUM-I |v 9321 |w (DE-604)BV006185376 |9 9321 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006158303 | ||
Datensatz im Suchindex
| _version_ | 1804123702326984704 |
|---|---|
| any_adam_object | |
| author | Heun, Volker Mayr, Ernst W. 1950- |
| author_GND | (DE-588)124668585 (DE-588)109817923 |
| author_facet | Heun, Volker Mayr, Ernst W. 1950- |
| author_role | aut aut |
| author_sort | Heun, Volker |
| author_variant | v h vh e w m ew ewm |
| building | Verbundindex |
| bvnumber | BV009253727 |
| ctrlnum | (OCoLC)31897457 (DE-599)BVBBV009253727 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01651nam a2200325 cb4500</leader><controlfield tag="001">BV009253727</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040414 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940314s1993 gw d||| t||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">940457415</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31897457</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009253727</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</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">Heun, Volker</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)124668585</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube</subfield><subfield code="c">Volker Heun ; Ernst W. Mayr</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20 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">9321</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The d-dimensional binary hypercube is a very popular model of parallel computation. On the other hand, the execution of many algorithms can be represented by binary trees, making desirable fast simulations of binary trees on hypercubes. In this paper, we present a simple one-to-one embedding of arbitrary binary trees into their optimal hypercubes with dilation 8 and constant congestion. The novelty of our method is based on the use of an intermediate quadtree data structure, which also permits the embedding to be efficiently computed on the hypercube itself."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Hypercube</subfield></datafield><datafield tag="700" 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="830" ind1=" " ind2="0"><subfield code="a">Technische Universität <München>: TUM-I</subfield><subfield code="v">9321</subfield><subfield code="w">(DE-604)BV006185376</subfield><subfield code="9">9321</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006158303</subfield></datafield></record></collection> |
| id | DE-604.BV009253727 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:33:58Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006158303 |
| oclc_num | 31897457 |
| 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 | 20 S. graph. Darst. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series | Technische Universität <München>: TUM-I |
| series2 | Technische Universität <München>: TUM-I |
| spelling | Heun, Volker Verfasser (DE-588)124668585 aut A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube Volker Heun ; Ernst W. Mayr München 1993 20 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Technische Universität <München>: TUM-I 9321 Abstract: "The d-dimensional binary hypercube is a very popular model of parallel computation. On the other hand, the execution of many algorithms can be represented by binary trees, making desirable fast simulations of binary trees on hypercubes. In this paper, we present a simple one-to-one embedding of arbitrary binary trees into their optimal hypercubes with dilation 8 and constant congestion. The novelty of our method is based on the use of an intermediate quadtree data structure, which also permits the embedding to be efficiently computed on the hypercube itself." Hypercube Mayr, Ernst W. 1950- Verfasser (DE-588)109817923 aut Technische Universität <München>: TUM-I 9321 (DE-604)BV006185376 9321 |
| spellingShingle | Heun, Volker Mayr, Ernst W. 1950- A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube Technische Universität <München>: TUM-I Hypercube |
| title | A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube |
| title_auth | A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube |
| title_exact_search | A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube |
| title_full | A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube Volker Heun ; Ernst W. Mayr |
| title_fullStr | A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube Volker Heun ; Ernst W. Mayr |
| title_full_unstemmed | A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube Volker Heun ; Ernst W. Mayr |
| title_short | A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube |
| title_sort | a new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube |
| topic | Hypercube |
| topic_facet | Hypercube |
| volume_link | (DE-604)BV006185376 |
| work_keys_str_mv | AT heunvolker anewefficientalgorithmforembeddinganarbitrarybinarytreeintoitsoptimalhypercube AT mayrernstw anewefficientalgorithmforembeddinganarbitrarybinarytreeintoitsoptimalhypercube |