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

Authors:
Risto Honkanen;Ville Leppänen;Martti Penttonen
Affiliations:
Department of Computer Science, University of Kuopio, Kuopio, Finland;Department of Computer Science, University of Turku, Turku, Finland;Department of Computer Science, University of Kuopio, Kuopio, Finland
Venue:
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Year:
2007

Citing 9
Cited 2

Locality, communication, and interconnect length in multicomputers

SIAM Journal on Computing
General purpose parallel architectures

Handbook of theoretical computer science (vol. A)
An optical simulation of shared memory

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Lower Bounds on Communication Loads and Optimal Placements in Torus Networks

IEEE Transactions on Computers
Solving Fundamental Problems on Sparse-Meshes

IEEE Transactions on Parallel and Distributed Systems
Work-optimal simulation of PRAM models on meshes

Nordic Journal of Computing
Efficient communication using total-exchange

IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
On Optimal Placements of Processors in Tori Networks

SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
Hot-Potato Routing Algorithms for Sparse Optical Torus

ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops

Towards programming on the moving threads architecture

Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies
A layout for sparse cube-connected-cycles network

Proceedings of the 12th International Conference on Computer Systems and Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we present a simple network design for all-to-all routing and study deflection routing on it. We present a time-scheduled routing algorithm where packets are routed address-free. We show that a total exchange relation, where every processor has a packet to route to every other processor, can be routed with routing cost of 1/2 + o(1) time units per packet. The network consists of an n-sided d-dimensional torus, where the nd-1 processor (or input/output) nodes are sparsely but regularly situated among nd - nd-1 deflection routing nodes, having d input and d output links. The finite-state routing nodes change their states by a fixed, preprogrammed pattern.