贪婪算法是一种动态组播路由算法，该算法获得的通信树时延较大。

Greedy algorithm achieves low cost multicast tree whose delay performance is worse than other trees.

youdao

因此，近几年来，如何为集合通信操作建立“最优”通信树的问题受到了越来越多的关注。

So, in recent years, the problem of how to building "optimal" communication trees for collective operations has received much attention.

youdao

这一方法不仅利用二项树通信步中的规则性，而且利用了二项树拓扑结构的规则性。

The method exploits regularities both in the communication phases and in the topological communication structure of a binomial tree.

youdao