Divide and conquer algorithms on the hypercube:
Abstract: "We show how to implement divide-and-conquer algorithms without undue overhead on a wide class of networks. We give an optimal generic divide-and-conquer implementation on hypercubes for the class of divide-and-conquer algorithms for which the total size of the subproblems on any leve...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
München
1993
|
| Schriftenreihe: | Technische Universität <München>: [TUM / 9000-9999]
9322 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We show how to implement divide-and-conquer algorithms without undue overhead on a wide class of networks. We give an optimal generic divide-and-conquer implementation on hypercubes for the class of divide-and-conquer algorithms for which the total size of the subproblems on any level of the recursion does not exceed the parent problem size. For this implementation, appropriately sized subcubes have to be allocated to the subproblems generated by the divide-steps. We take care that these allocation steps do not cause any unbalanced distribution of work, and that, asymptotically, they do not increase the running time. Variants of our generic algorithm also work for the butterfly network and, by a general simulation, for the class of hypercubic networks, including the shuffle- exchange and the cube-connected-cycles network. Our results can also be applied to optimally solve various types of routing problems." |
| Beschreibung: | 14 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009253735 | ||
| 003 | DE-604 | ||
| 005 | 19941010 | ||
| 007 | t | ||
| 008 | 940314s1993 gw d||| t||| 00||| eng d | ||
| 016 | 7 | |a 94045727X |2 DE-101 | |
| 035 | |a (OCoLC)31897446 | ||
| 035 | |a (DE-599)BVBBV009253735 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-29T |a DE-12 | ||
| 100 | 1 | |a Mayr, Ernst W. |d 1950- |e Verfasser |0 (DE-588)109817923 |4 aut | |
| 245 | 1 | 0 | |a Divide and conquer algorithms on the hypercube |c Ernst W. Mayr ; Ralph Werchner |
| 246 | 1 | 3 | |a Devide and conquer algorithms on the hypercube |
| 264 | 1 | |a München |c 1993 | |
| 300 | |a 14 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 / 9000-9999] |v 9322 | |
| 520 | 3 | |a Abstract: "We show how to implement divide-and-conquer algorithms without undue overhead on a wide class of networks. We give an optimal generic divide-and-conquer implementation on hypercubes for the class of divide-and-conquer algorithms for which the total size of the subproblems on any level of the recursion does not exceed the parent problem size. For this implementation, appropriately sized subcubes have to be allocated to the subproblems generated by the divide-steps. We take care that these allocation steps do not cause any unbalanced distribution of work, and that, asymptotically, they do not increase the running time. Variants of our generic algorithm also work for the butterfly network and, by a general simulation, for the class of hypercubic networks, including the shuffle- exchange and the cube-connected-cycles network. Our results can also be applied to optimally solve various types of routing problems." | |
| 650 | 4 | |a Hypercube | |
| 650 | 0 | 7 | |a Divide-and-conquer-Verfahren |0 (DE-588)4291466-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Hypercube |0 (DE-588)4246400-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Hypercube |0 (DE-588)4246400-6 |D s |
| 689 | 0 | 1 | |a Divide-and-conquer-Verfahren |0 (DE-588)4291466-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Werchner, Ralph |e Verfasser |4 aut | |
| 810 | 2 | |a 9000-9999] |t Technische Universität <München>: [TUM |v 9322 |w (DE-604)BV006185376 |9 9322 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006158307 | ||
Datensatz im Suchindex
| _version_ | 1804123702331179008 |
|---|---|
| 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 | BV009253735 |
| ctrlnum | (OCoLC)31897446 (DE-599)BVBBV009253735 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02299nam a2200397 cb4500</leader><controlfield tag="001">BV009253735</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19941010 </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">94045727X</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31897446</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009253735</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></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">Divide and conquer algorithms on the hypercube</subfield><subfield code="c">Ernst W. Mayr ; Ralph Werchner</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Devide and conquer algorithms on the hypercube</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">14 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 / 9000-9999]</subfield><subfield code="v">9322</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We show how to implement divide-and-conquer algorithms without undue overhead on a wide class of networks. We give an optimal generic divide-and-conquer implementation on hypercubes for the class of divide-and-conquer algorithms for which the total size of the subproblems on any level of the recursion does not exceed the parent problem size. For this implementation, appropriately sized subcubes have to be allocated to the subproblems generated by the divide-steps. We take care that these allocation steps do not cause any unbalanced distribution of work, and that, asymptotically, they do not increase the running time. Variants of our generic algorithm also work for the butterfly network and, by a general simulation, for the class of hypercubic networks, including the shuffle- exchange and the cube-connected-cycles network. Our results can also be applied to optimally solve various types of routing problems."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Hypercube</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Divide-and-conquer-Verfahren</subfield><subfield code="0">(DE-588)4291466-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Hypercube</subfield><subfield code="0">(DE-588)4246400-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Hypercube</subfield><subfield code="0">(DE-588)4246400-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Divide-and-conquer-Verfahren</subfield><subfield code="0">(DE-588)4291466-8</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">Werchner, Ralph</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">9000-9999]</subfield><subfield code="t">Technische Universität <München>: [TUM</subfield><subfield code="v">9322</subfield><subfield code="w">(DE-604)BV006185376</subfield><subfield code="9">9322</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006158307</subfield></datafield></record></collection> |
| id | DE-604.BV009253735 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:33:58Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006158307 |
| oclc_num | 31897446 |
| open_access_boolean | |
| owner | DE-29T DE-12 |
| owner_facet | DE-29T DE-12 |
| physical | 14 S. graph. Darst. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Technische Universität <München>: [TUM / 9000-9999] |
| spelling | Mayr, Ernst W. 1950- Verfasser (DE-588)109817923 aut Divide and conquer algorithms on the hypercube Ernst W. Mayr ; Ralph Werchner Devide and conquer algorithms on the hypercube München 1993 14 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Technische Universität <München>: [TUM / 9000-9999] 9322 Abstract: "We show how to implement divide-and-conquer algorithms without undue overhead on a wide class of networks. We give an optimal generic divide-and-conquer implementation on hypercubes for the class of divide-and-conquer algorithms for which the total size of the subproblems on any level of the recursion does not exceed the parent problem size. For this implementation, appropriately sized subcubes have to be allocated to the subproblems generated by the divide-steps. We take care that these allocation steps do not cause any unbalanced distribution of work, and that, asymptotically, they do not increase the running time. Variants of our generic algorithm also work for the butterfly network and, by a general simulation, for the class of hypercubic networks, including the shuffle- exchange and the cube-connected-cycles network. Our results can also be applied to optimally solve various types of routing problems." Hypercube Divide-and-conquer-Verfahren (DE-588)4291466-8 gnd rswk-swf Hypercube (DE-588)4246400-6 gnd rswk-swf Hypercube (DE-588)4246400-6 s Divide-and-conquer-Verfahren (DE-588)4291466-8 s DE-604 Werchner, Ralph Verfasser aut 9000-9999] Technische Universität <München>: [TUM 9322 (DE-604)BV006185376 9322 |
| spellingShingle | Mayr, Ernst W. 1950- Werchner, Ralph Divide and conquer algorithms on the hypercube Hypercube Divide-and-conquer-Verfahren (DE-588)4291466-8 gnd Hypercube (DE-588)4246400-6 gnd |
| subject_GND | (DE-588)4291466-8 (DE-588)4246400-6 |
| title | Divide and conquer algorithms on the hypercube |
| title_alt | Devide and conquer algorithms on the hypercube |
| title_auth | Divide and conquer algorithms on the hypercube |
| title_exact_search | Divide and conquer algorithms on the hypercube |
| title_full | Divide and conquer algorithms on the hypercube Ernst W. Mayr ; Ralph Werchner |
| title_fullStr | Divide and conquer algorithms on the hypercube Ernst W. Mayr ; Ralph Werchner |
| title_full_unstemmed | Divide and conquer algorithms on the hypercube Ernst W. Mayr ; Ralph Werchner |
| title_short | Divide and conquer algorithms on the hypercube |
| title_sort | divide and conquer algorithms on the hypercube |
| topic | Hypercube Divide-and-conquer-Verfahren (DE-588)4291466-8 gnd Hypercube (DE-588)4246400-6 gnd |
| topic_facet | Hypercube Divide-and-conquer-Verfahren |
| volume_link | (DE-604)BV006185376 |
| work_keys_str_mv | AT mayrernstw divideandconqueralgorithmsonthehypercube AT werchnerralph divideandconqueralgorithmsonthehypercube AT mayrernstw devideandconqueralgorithmsonthehypercube AT werchnerralph devideandconqueralgorithmsonthehypercube |