Faster sorting and routing on grids with diagonals:
Abstract: "We study routing and sorting on grids with diagonal connections. We show that for so-called h-h problems faster solutions can be obtained than on comparable grids without diagonals. In most of the cases the number of transport steps for the new algorithms are less than half of the pr...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
München
1993
|
| Schriftenreihe: | Technische Universität <München>: TUM-I
9313 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We study routing and sorting on grids with diagonal connections. We show that for so-called h-h problems faster solutions can be obtained than on comparable grids without diagonals. In most of the cases the number of transport steps for the new algorithms are less than half of the principle smallest number given by the bisection bound for grids without diagonals." |
| Beschreibung: | 31 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009130210 | ||
| 003 | DE-604 | ||
| 005 | 20230116 | ||
| 007 | t | ||
| 008 | 940307s1993 gw d||| t||| 00||| eng d | ||
| 016 | 7 | |a 940414147 |2 DE-101 | |
| 035 | |a (OCoLC)31897447 | ||
| 035 | |a (DE-599)BVBBV009130210 | ||
| 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 Kunde, Manfred |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Faster sorting and routing on grids with diagonals |c Manfred Kunde ; Rolf Niedermeier ; Peter Rossmanith |
| 264 | 1 | |a München |c 1993 | |
| 300 | |a 31 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 9313 | |
| 490 | 1 | |a Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht / A |v 1993,5 | |
| 520 | 3 | |a Abstract: "We study routing and sorting on grids with diagonal connections. We show that for so-called h-h problems faster solutions can be obtained than on comparable grids without diagonals. In most of the cases the number of transport steps for the new algorithms are less than half of the principle smallest number given by the bisection bound for grids without diagonals." | |
| 650 | 4 | |a Sorting (Electronic computers) | |
| 700 | 1 | |a Niedermeier, Rolf |d 19XX- |e Verfasser |0 (DE-588)105937899X |4 aut | |
| 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 1993,5 |w (DE-604)BV004627888 |9 1993,5 | |
| 830 | 0 | |a Technische Universität <München>: TUM-I |v 9313 |w (DE-604)BV006185376 |9 9313 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006051777 | ||
Datensatz im Suchindex
| _version_ | 1804123546454065152 |
|---|---|
| any_adam_object | |
| author | Kunde, Manfred Niedermeier, Rolf 19XX- Rossmanith, Peter |
| author_GND | (DE-588)105937899X (DE-588)1084817721 |
| author_facet | Kunde, Manfred Niedermeier, Rolf 19XX- Rossmanith, Peter |
| author_role | aut aut aut |
| author_sort | Kunde, Manfred |
| author_variant | m k mk r n rn p r pr |
| building | Verbundindex |
| bvnumber | BV009130210 |
| ctrlnum | (OCoLC)31897447 (DE-599)BVBBV009130210 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01803nam a2200361 cb4500</leader><controlfield tag="001">BV009130210</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230116 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940307s1993 gw d||| t||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">940414147</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31897447</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009130210</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">Kunde, Manfred</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Faster sorting and routing on grids with diagonals</subfield><subfield code="c">Manfred Kunde ; Rolf Niedermeier ; Peter Rossmanith</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">31 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">9313</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">1993,5</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We study routing and sorting on grids with diagonal connections. We show that for so-called h-h problems faster solutions can be obtained than on comparable grids without diagonals. In most of the cases the number of transport steps for the new algorithms are less than half of the principle smallest number given by the bisection bound for grids without diagonals."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sorting (Electronic computers)</subfield></datafield><datafield tag="700" 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="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">1993,5</subfield><subfield code="w">(DE-604)BV004627888</subfield><subfield code="9">1993,5</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Technische Universität <München>: TUM-I</subfield><subfield code="v">9313</subfield><subfield code="w">(DE-604)BV006185376</subfield><subfield code="9">9313</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006051777</subfield></datafield></record></collection> |
| id | DE-604.BV009130210 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:31:29Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006051777 |
| oclc_num | 31897447 |
| open_access_boolean | |
| owner | DE-29T DE-12 |
| owner_facet | DE-29T DE-12 |
| physical | 31 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 Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht / A |
| spelling | Kunde, Manfred Verfasser aut Faster sorting and routing on grids with diagonals Manfred Kunde ; Rolf Niedermeier ; Peter Rossmanith München 1993 31 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Technische Universität <München>: TUM-I 9313 Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht / A 1993,5 Abstract: "We study routing and sorting on grids with diagonal connections. We show that for so-called h-h problems faster solutions can be obtained than on comparable grids without diagonals. In most of the cases the number of transport steps for the new algorithms are less than half of the principle smallest number given by the bisection bound for grids without diagonals." Sorting (Electronic computers) Niedermeier, Rolf 19XX- Verfasser (DE-588)105937899X aut Rossmanith, Peter Verfasser (DE-588)1084817721 aut A Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht 1993,5 (DE-604)BV004627888 1993,5 Technische Universität <München>: TUM-I 9313 (DE-604)BV006185376 9313 |
| spellingShingle | Kunde, Manfred Niedermeier, Rolf 19XX- Rossmanith, Peter Faster sorting and routing on grids with diagonals Technische Universität <München>: TUM-I Sorting (Electronic computers) |
| title | Faster sorting and routing on grids with diagonals |
| title_auth | Faster sorting and routing on grids with diagonals |
| title_exact_search | Faster sorting and routing on grids with diagonals |
| title_full | Faster sorting and routing on grids with diagonals Manfred Kunde ; Rolf Niedermeier ; Peter Rossmanith |
| title_fullStr | Faster sorting and routing on grids with diagonals Manfred Kunde ; Rolf Niedermeier ; Peter Rossmanith |
| title_full_unstemmed | Faster sorting and routing on grids with diagonals Manfred Kunde ; Rolf Niedermeier ; Peter Rossmanith |
| title_short | Faster sorting and routing on grids with diagonals |
| title_sort | faster sorting and routing on grids with diagonals |
| topic | Sorting (Electronic computers) |
| topic_facet | Sorting (Electronic computers) |
| volume_link | (DE-604)BV004627888 (DE-604)BV006185376 |
| work_keys_str_mv | AT kundemanfred fastersortingandroutingongridswithdiagonals AT niedermeierrolf fastersortingandroutingongridswithdiagonals AT rossmanithpeter fastersortingandroutingongridswithdiagonals |