A4 Refereed article in a conference publication
Address-free all-to-all routing in sparse torus
Authors: Honkanen R, Leppänen V, Penttonen M
Editors: Victor Malyshkin
Publishing place: Springer Berlin Heidelberg
Publication year: 2007
Journal:: Lecture Notes in Computer Science
Book title : Proceedings of 9th International Conference, PaCT 2007
Journal name in source: PARALLEL COMPUTING TECHNOLOGIES, PROCEEDINGS
Journal acronym: LECT NOTES COMPUT SC
Series title: Lecture Notes in Computer Science
Number in series: 4671
Volume: 4671
First page : 200
Last page: 205
Number of pages: 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
Abstract
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.