MINIMAL-DISTANCE ROUTING FOR KYKLOS II

We propose a new routing strategy for the KYKLOS II multiprocessor interconnection network which achieves minimum distance for the path between any two processors. For KYKLOS II with 2 n processors, the average distance is shorter than those of previous routing strategies by approximately 2 log 2 n. The traffic density, a measure of traffic concentration, is comparable or better than previous strategies for up to two thousand processors, but is soundly beaten by a strategy proposed by Jenevein and Menezes for larger n