Conference paper
On optimal placements of processors in Tori networks
M. Blaum, J. Bruck, et al.
IPDPS 1996
The following communication scheme is considered: a binary vector of length n is transmitted using n parallel wires. Each wire represents a coordinate of the vector. The propagation delay in the wires varies. Arrival of a transition represents a 1 while absence of a transition represents a 0. The problem is to find an efficient communication scheme that will be delay-insensitive.
M. Blaum, J. Bruck, et al.
IPDPS 1996
J. Bruck, Luc de Coster, et al.
IPDPS 1994
G. Markarian, B. Honary, et al.
Electronics Letters
M. Blaum, Henk van Tilborg
ISIT 1987