Off-line routing with small queues on a mesh-connected processor array:
Abstract: "We present several efficient and simple algorithms for off-line routing that use very small queues. On an n x n mesh-connected processor array, we show a 2.5n step algorithm to off-line route permutations using queues of size 2, and a 2.25n + 3 step algorithm that uses queues of size...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Rochester, NY
1991
|
| Series: | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report
390 |
| Subjects: | |
| Summary: | Abstract: "We present several efficient and simple algorithms for off-line routing that use very small queues. On an n x n mesh-connected processor array, we show a 2.5n step algorithm to off-line route permutations using queues of size 2, and a 2.25n + 3 step algorithm that uses queues of size 4. Our main result is that there exists an off-line algorithm for permutation routing on the n x n mesh-connected processor array, that takes 2.2n + 5 steps, and uses queues of size not more than 14. Our algorithms use novel and interesting techniques, and the bounds on the queue size are smaller than those of known algorithms with the same time complexity." |
| Physical Description: | 12 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008992630 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)26188484 | ||
| 035 | |a (DE-599)BVBBV008992630 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Krizanc, Danny |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Off-line routing with small queues on a mesh-connected processor array |c Danny Krizanc ; Lata Narayanan |
| 264 | 1 | |a Rochester, NY |c 1991 | |
| 300 | |a 12 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |v 390 | |
| 520 | 3 | |a Abstract: "We present several efficient and simple algorithms for off-line routing that use very small queues. On an n x n mesh-connected processor array, we show a 2.5n step algorithm to off-line route permutations using queues of size 2, and a 2.25n + 3 step algorithm that uses queues of size 4. Our main result is that there exists an off-line algorithm for permutation routing on the n x n mesh-connected processor array, that takes 2.2n + 5 steps, and uses queues of size not more than 14. Our algorithms use novel and interesting techniques, and the bounds on the queue size are smaller than those of known algorithms with the same time complexity." | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 650 | 4 | |a Routing-machines | |
| 700 | 1 | |a Narayanan, Lata |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University of Rochester <Rochester, NY> |v 390 |w (DE-604)BV008902697 |9 390 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005941560 | ||
Record in the Search Index
| _version_ | 1804123335108329472 |
|---|---|
| any_adam_object | |
| author | Krizanc, Danny Narayanan, Lata |
| author_facet | Krizanc, Danny Narayanan, Lata |
| author_role | aut aut |
| author_sort | Krizanc, Danny |
| author_variant | d k dk l n ln |
| building | Verbundindex |
| bvnumber | BV008992630 |
| ctrlnum | (OCoLC)26188484 (DE-599)BVBBV008992630 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01745nam a2200313 cb4500</leader><controlfield tag="001">BV008992630</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26188484</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008992630</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></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Krizanc, Danny</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Off-line routing with small queues on a mesh-connected processor array</subfield><subfield code="c">Danny Krizanc ; Lata Narayanan</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Rochester, NY</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">12 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">University of Rochester <Rochester, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">390</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We present several efficient and simple algorithms for off-line routing that use very small queues. On an n x n mesh-connected processor array, we show a 2.5n step algorithm to off-line route permutations using queues of size 2, and a 2.25n + 3 step algorithm that uses queues of size 4. Our main result is that there exists an off-line algorithm for permutation routing on the n x n mesh-connected processor array, that takes 2.2n + 5 steps, and uses queues of size not more than 14. Our algorithms use novel and interesting techniques, and the bounds on the queue size are smaller than those of known algorithms with the same time complexity."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Routing-machines</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Narayanan, Lata</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">University of Rochester <Rochester, NY></subfield><subfield code="v">390</subfield><subfield code="w">(DE-604)BV008902697</subfield><subfield code="9">390</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005941560</subfield></datafield></record></collection> |
| id | DE-604.BV008992630 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:08Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005941560 |
| oclc_num | 26188484 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 12 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |
| spelling | Krizanc, Danny Verfasser aut Off-line routing with small queues on a mesh-connected processor array Danny Krizanc ; Lata Narayanan Rochester, NY 1991 12 S. txt rdacontent n rdamedia nc rdacarrier University of Rochester <Rochester, NY> / Department of Computer Science: Technical report 390 Abstract: "We present several efficient and simple algorithms for off-line routing that use very small queues. On an n x n mesh-connected processor array, we show a 2.5n step algorithm to off-line route permutations using queues of size 2, and a 2.25n + 3 step algorithm that uses queues of size 4. Our main result is that there exists an off-line algorithm for permutation routing on the n x n mesh-connected processor array, that takes 2.2n + 5 steps, and uses queues of size not more than 14. Our algorithms use novel and interesting techniques, and the bounds on the queue size are smaller than those of known algorithms with the same time complexity." Parallel processing (Electronic computers) Routing-machines Narayanan, Lata Verfasser aut Department of Computer Science: Technical report University of Rochester <Rochester, NY> 390 (DE-604)BV008902697 390 |
| spellingShingle | Krizanc, Danny Narayanan, Lata Off-line routing with small queues on a mesh-connected processor array Parallel processing (Electronic computers) Routing-machines |
| title | Off-line routing with small queues on a mesh-connected processor array |
| title_auth | Off-line routing with small queues on a mesh-connected processor array |
| title_exact_search | Off-line routing with small queues on a mesh-connected processor array |
| title_full | Off-line routing with small queues on a mesh-connected processor array Danny Krizanc ; Lata Narayanan |
| title_fullStr | Off-line routing with small queues on a mesh-connected processor array Danny Krizanc ; Lata Narayanan |
| title_full_unstemmed | Off-line routing with small queues on a mesh-connected processor array Danny Krizanc ; Lata Narayanan |
| title_short | Off-line routing with small queues on a mesh-connected processor array |
| title_sort | off line routing with small queues on a mesh connected processor array |
| topic | Parallel processing (Electronic computers) Routing-machines |
| topic_facet | Parallel processing (Electronic computers) Routing-machines |
| volume_link | (DE-604)BV008902697 |
| work_keys_str_mv | AT krizancdanny offlineroutingwithsmallqueuesonameshconnectedprocessorarray AT narayananlata offlineroutingwithsmallqueuesonameshconnectedprocessorarray |