A4 Refereed article in a conference publication

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




AuthorsHonkanen R, Leppänen V, Penttonen M

EditorsVictor Malyshkin

Publishing placeSpringer Berlin Heidelberg

Publication year2007

Journal:Lecture Notes in Computer Science

Book title Proceedings of 9th International Conference, PaCT 2007

Journal name in sourcePARALLEL COMPUTING TECHNOLOGIES, PROCEEDINGS

Journal acronymLECT NOTES COMPUT SC

Series titleLecture Notes in Computer Science

Number in series4671

Volume4671

First page 200

Last page205

Number of pages2

ISBN978-3-540-73939-5

eISBN978-3-540-73940-1

ISSN0302-9743

DOIhttps://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.



Last updated on 2025-14-10 at 09:59