J.F. Myoupo, H.-B. Ndamas, and D. Semé (France)
Parallel Architectures, Interconnection Networks,
Hexagonal Mesh, Routing, Communication Algorithms.
In this paper we study hexagonal interconnection net
works. A convenient addressing scheme and routing algo
rithm are proposed. It is the ﬁrst addressing scheme as
suming both the unicity of the coordinates for each node
and a distance formula between two nodes. We continue
by developping an optimal routing algorithm based on the
distance formula in order to use shortest paths from the
source to the destination node. Our results are obtained
with the help of the one-to-all and all-to-all algorithms de
scribed in .