| Abstract |
|---|
| This paper presents two results on structural and communicationproperties of Kautz networks.First, we give tight upper and lower bounds on the average distance ofKautz (di)graphs. Second, we describe an algorithm forall-to-all scatter in noncombining all-port store-&-forwardKautz networks. The algorithm is memory-optimal and asymptoticallytime- and transmission-optimal. The difference between the time ofthe algorithm and the lower bound is less than five percent for d>=5,where d is the size of the alphabet of Kautz strings. |
| Contact |
| Pavel Tvrdik Department of Comp.Sci.& Engr.,Faculty of Electrical Engineering,Czech Technical University,Karlovo nam. 13, 12135 Praha 2,Czech Republic , tvrdik@sun.felk.cvut.cz |