All-to-all broadcasting algorithms on honeycomb tori
蜂窝环上的全广播算法*

This paper addressed all-to-all broadcasting algorithms on honeycomb tori.The design of the first all-to-all broadcasting algorithm was to find a path going through all the nodes,and the main task was to determine some special nodes on the border.The second one used the fact that honeycomb tori was Hamiltonian.Considering a network with n processors,the former had personalized routing strategy at each node and it required a 3n communication time complexity.This communication time could be reduced to n becau...