A4 Vertaisarvioitu artikkeli konferenssijulkaisussa
Address-free all-to-all routing in sparse torus
Tekijät: Honkanen R, Leppänen V, Penttonen M
Toimittaja: Victor Malyshkin
Kustannuspaikka: Springer Berlin Heidelberg
Julkaisuvuosi: 2007
Lehti:: Lecture Notes in Computer Science
Kokoomateoksen nimi: Proceedings of 9th International Conference, PaCT 2007
Tietokannassa oleva lehden nimi: PARALLEL COMPUTING TECHNOLOGIES, PROCEEDINGS
Lehden akronyymi: LECT NOTES COMPUT SC
Sarjan nimi: Lecture Notes in Computer Science
Numero sarjassa: 4671
Vuosikerta: 4671
Aloitussivu: 200
Lopetussivu: 205
Sivujen määrä: 2
ISBN: 978-3-540-73939-5
eISBN: 978-3-540-73940-1
ISSN: 0302-9743
DOI: https://doi.org/10.1007/978-3-540-73940-1_21
Tiivistelmä
The network consists of an n-sided d-dimensional torus, where the n(d-1) processor (or input/output) nodes are sparsely but regularly situated among n(d)-n(d-1) deflection routing nodes, having d input and d output links. The finite-state routing nodes change their states by a fixed, preprogrammed pattern.
The network consists of an n-sided d-dimensional torus, where the n(d-1) processor (or input/output) nodes are sparsely but regularly situated among n(d)-n(d-1) deflection routing nodes, having d input and d output links. The finite-state routing nodes change their states by a fixed, preprogrammed pattern.