A note on off-line permutation routing on a mesh-connected processor array:
Abstract: "We show how to off-line route any permutation of a n x n mesh-connected processor array in 2.5n - 3 steps with at most 6 packets per processor per time step in 2.25n + 3 steps with at most 8 packets per processor per time step."
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Rochester, NY
1990
|
| Schriftenreihe: | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report
362 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We show how to off-line route any permutation of a n x n mesh-connected processor array in 2.5n - 3 steps with at most 6 packets per processor per time step in 2.25n + 3 steps with at most 8 packets per processor per time step." |
| Beschreibung: | 5 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008974835 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)25621923 | ||
| 035 | |a (DE-599)BVBBV008974835 | ||
| 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 A note on off-line permutation routing on a mesh-connected processor array |c Danny Krizanc |
| 264 | 1 | |a Rochester, NY |c 1990 | |
| 300 | |a 5 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 362 | |
| 520 | 3 | |a Abstract: "We show how to off-line route any permutation of a n x n mesh-connected processor array in 2.5n - 3 steps with at most 6 packets per processor per time step in 2.25n + 3 steps with at most 8 packets per processor per time step." | |
| 650 | 4 | |a Computer architecture | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University of Rochester <Rochester, NY> |v 362 |w (DE-604)BV008902697 |9 362 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005926365 | ||
Datensatz im Suchindex
| _version_ | 1804123312918364160 |
|---|---|
| any_adam_object | |
| author | Krizanc, Danny |
| author_facet | Krizanc, Danny |
| author_role | aut |
| author_sort | Krizanc, Danny |
| author_variant | d k dk |
| building | Verbundindex |
| bvnumber | BV008974835 |
| ctrlnum | (OCoLC)25621923 (DE-599)BVBBV008974835 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01275nam a2200301 cb4500</leader><controlfield tag="001">BV008974835</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25621923</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008974835</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">A note on off-line permutation routing on a mesh-connected processor array</subfield><subfield code="c">Danny Krizanc</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Rochester, NY</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">5 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">362</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We show how to off-line route any permutation of a n x n mesh-connected processor array in 2.5n - 3 steps with at most 6 packets per processor per time step in 2.25n + 3 steps with at most 8 packets per processor per time step."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer architecture</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</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">362</subfield><subfield code="w">(DE-604)BV008902697</subfield><subfield code="9">362</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005926365</subfield></datafield></record></collection> |
| id | DE-604.BV008974835 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:47Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005926365 |
| oclc_num | 25621923 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 5 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |
| spelling | Krizanc, Danny Verfasser aut A note on off-line permutation routing on a mesh-connected processor array Danny Krizanc Rochester, NY 1990 5 S. txt rdacontent n rdamedia nc rdacarrier University of Rochester <Rochester, NY> / Department of Computer Science: Technical report 362 Abstract: "We show how to off-line route any permutation of a n x n mesh-connected processor array in 2.5n - 3 steps with at most 6 packets per processor per time step in 2.25n + 3 steps with at most 8 packets per processor per time step." Computer architecture Parallel processing (Electronic computers) Department of Computer Science: Technical report University of Rochester <Rochester, NY> 362 (DE-604)BV008902697 362 |
| spellingShingle | Krizanc, Danny A note on off-line permutation routing on a mesh-connected processor array Computer architecture Parallel processing (Electronic computers) |
| title | A note on off-line permutation routing on a mesh-connected processor array |
| title_auth | A note on off-line permutation routing on a mesh-connected processor array |
| title_exact_search | A note on off-line permutation routing on a mesh-connected processor array |
| title_full | A note on off-line permutation routing on a mesh-connected processor array Danny Krizanc |
| title_fullStr | A note on off-line permutation routing on a mesh-connected processor array Danny Krizanc |
| title_full_unstemmed | A note on off-line permutation routing on a mesh-connected processor array Danny Krizanc |
| title_short | A note on off-line permutation routing on a mesh-connected processor array |
| title_sort | a note on off line permutation routing on a mesh connected processor array |
| topic | Computer architecture Parallel processing (Electronic computers) |
| topic_facet | Computer architecture Parallel processing (Electronic computers) |
| volume_link | (DE-604)BV008902697 |
| work_keys_str_mv | AT krizancdanny anoteonofflinepermutationroutingonameshconnectedprocessorarray |