递归对角环网及其技术特性

Recursive diagonal torus and its technical properties

递归对角环网（RDT,Recursive Diagonal Torns）是一种适用于节点数大于216的大规模并行计算机的互联网络。RDT充分利用了递归结构的对角环网连接,其直径及每节点的链接数远小于具有同样节点的超立方体。先给出了一些RDT及其相关定义,介绍了RDT的环网分配策略。在将RDT与其它网络进行比较的基础上,描述了RDT的技术特性。

Recursive Diagonal Torus (RDT), a interconnection network, is suitable to massively parallel computers with up to 216 nodes. By making the best use of a recursively structured diagonal torus connection, the RDT has a smaller diameter with reduced links per node than those of the hypercube. This paper gives the RDT and its reference definitions, and introduces the torus assignment of RDT (2,4,1). The technical properties of RDT are described based on the comparison with other networks for MFCs .