Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Hi-index | 0.00 |
The search for multiprocessor interconnection network, an optimal one in respect of the minimum communication path between processing elements (PE) is reported. Attention is paid to the 'low wired' PEs networks, e.g. transputers. It is shown that the minimal longest path between PEs can be shortened considerably in comparison with the classical periodic mesh topology, i.e. by 30% for four- and by 40% for six-channels PEs.