Evaluation of d-mesh Interconnect for SoC

摘要

$d$-meshes belong to an extended family of regular two-dimensional meshes of an arbitrary degree $d$. They have shorter maximal and average node-to-node distances than most other interconnection networks. Competitive congestion-free routing algorithms for all-to-all communication can be implemented on $d$-meshes. Additional nodes can be added to the system with no changes on most of existing nodes and with higher scalability than by other interconnection topologies. The communication links can be implemented by a small number of planes carrying only non-crossing connections. Such properties could be advantageous in eventual applications of $d$-meshes for interconnection topologies in systems-on-chips.