Address-free all-to-all routing in sparse torus

: Honkanen R, Leppänen V, Penttonen M

: Victor Malyshkin

: Springer Berlin Heidelberg

: 2007

: Lecture Notes in Computer Science

: Proceedings of 9th International Conference, PaCT 2007

: PARALLEL COMPUTING TECHNOLOGIES, PROCEEDINGS

: LECT NOTES COMPUT SC

: Lecture Notes in Computer Science

: 4671

: 200

: 205

: 2

: 978-3-540-73939-5

: 978-3-540-73940-1

: 0302-9743

DOI: https://doi.org/10.1007/978-3-540-73940-1_21

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.

Engineering and technology