All-to-All Scatter in Kautz networks
We give lower and upper bounds on the average distance of Kautz digraph. Using this result, we give a memory-optimal and asymptotically time-optimal algorithm for All-to-All-Scatter in noncombining all-port store-&-forward Kautz networks.
Unable to display preview. Download preview PDF.